OJ Board

Hi everyone. Please help me. I tried to used a dp recurrence with complexity 7 * n * 2^n to solve this problem, but it is obviously too slow for n=20. Any hints on this? Really look forward for some enlightenments!! Thanks.

Hello friends. Finally got the AC. For those who are getting WA, check if you have used something like this: int upcomp(const void *a, const void *b){ return (*(int *)a) - (*(int*)b); } This will cause overflow can gives wrong output! I have been using this for quite a long time though :-? . Use ">"...

Hello everyone, I'm solving this problem with dp. Let best[k][v] be the minimum path cost to reach vertex v, passing through k number of edges along the path. Am I on the right track? I got the same output for the datasets given in the discussion above. Are they any tricky cases? And I added an EPS ...

To kabir, don't forget there might be negative numbers given in the input set.

Sorry, code removed

Hi saiful.. These are the cases for you: None of them is b2 sequence.

Hi sreejond, I don't know whether u've got AC, but this is the case where your program failed:

input:
1
10000
2
9999
9999

output:
19998 2

Hope this helps!

how to determine a particular number is only multiple of 2 number!!! plz some give me some idea; i remove number containing more than 2-(5,9,13,17.....) but cant handle case like:-5*117=(5*9*17). how to handle them????? If the number is a multiple of two h-primes, then it can't be a multiple of mor...