Search found 67 matches

by rushel
Thu Oct 27, 2005 8:47 pm
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13458

Using Discrete Math

Of course this prob can be solved by DP and u can also solve this problem
using combination with repetition:

x1+x2+...+xk = n
how many solution does the above equation have answers the problem.
whie xi>=0 and xi <=n

Refrence : Discrete Mathmatics and Its Application by Rosen Page 336
by rushel
Mon Oct 24, 2005 3:14 pm
Forum: Volume 109 (10900-10999)
Topic: 10944 - Nuts for nuts..
Replies: 35
Views: 15268

Thanks

Thanks to Larry and txandi for helping me. I am finding the link very useful thanks once again both of u.
by rushel
Sun Oct 23, 2005 2:27 pm
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13458

Output

1
3
6
1
4
10
20
1
5
15
35
70
420660
686660
319660
441660
5151
101
by rushel
Sun Oct 23, 2005 12:55 pm
Forum: Volume 109 (10900-10999)
Topic: 10944 - Nuts for nuts..
Replies: 35
Views: 15268

TSP

Thanks Larry.
I know its a TSP problem but i was worried about TLE. Can u give me a refrence to TSP algorithm
by rushel
Sun Oct 23, 2005 11:20 am
Forum: Volume 109 (10900-10999)
Topic: 10944 - Nuts for nuts..
Replies: 35
Views: 15268

10944 - Nuts for nuts..

I use bfs to solve this problem can anyone please give me some test data
It will be very helpful for me. Please help if possible.
by rushel
Thu Jul 28, 2005 12:26 pm
Forum: Volume 104 (10400-10499)
Topic: 10422 - Knights in FEN
Replies: 49
Views: 18007

10422

I was trying to reach given configuration to final using backtracking and pruning but get WA few times. Then i try to reach final to given and get AC:) I realize that after testing with the following input: 5 * 5 matrix with spaces ( right no knights ) and its not necessery there always be 24 knight...
by rushel
Sun Feb 13, 2005 8:27 am
Forum: Volume 6 (600-699)
Topic: 677 - All Walks of length "n" from the first node
Replies: 17
Views: 8161

very simple

I was having the same problem.
but when i read the following line from the problem carefully i got AC :)

the line:
Separate the output of the different cases by a blank line.

if( N == -9999 ) {
cout << endl;
continue;
}


:D

Go to advanced search