UVa OJ Board

You can also try:
0 0
-1 -1

it's a tree -

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.

Try this:
1 2 3 4 0 0
-1 -1
It's not a tree

1) In cases where there is no match to any of the patterns
mentioned in the problem description DON'T print a blank line
2) Dont' print eoln at the end of output

Thanks for your answers. I've finally solve this problem. I've created two arrays: bool wasadd[2 000 001] and int sums[2 000 001] It's "only" ;) 2 000 000 possible sums. I show my algorithm using example: Set: 2,3,4 Sum to find: 7 wassadd[2+1 000 000] = 1; sums[0] = 2; for members of set from 3 to 4...

There is a set of N integers in range [-1000, 1000], N< 1000 I have to find if there is any subset which sum of elements is exactly S. S is an integer in range [-1 000 000, 1 000 000 ] Example: Set - {5, 10, 25, 50} S = 30 I can find a subset {5,25} - 5+25 = 30 Set - { -6,9,100,-45} S = -42 I can fi...

I had this problem too.
1. C(n,k) = C(n,n-k)
2. My program memorizes C(n,k) for n and k < 1000
3. C(n,0) = 1;
C(n, n) = 1;
C(n,1) = n;
I hope it will help you.

http://acm.uva.es/p/v102/10205.html I have WA :( Please help or send test which my program fails. #include <cstdio> int tab[105][54], wyn[54], seq[800000], n, st; void printcard(int x) { int col, nr; x--; nr = x%13; col = x/13; if (nr<=8) printf("%d", nr+2); if (nr==9) printf("Jack"); if (nr==10) p...

You should create array for saving alredy computed numbers

In my opinion you shouldn't use fopen and fprintf function.

Thank you a lot

Thank you!
I've had problem with reading input, too