
Search found 7 matches
- Wed Jan 06, 2010 3:29 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11691 - Allergy Test
- Replies: 1
- Views: 3663
11691 - Allergy Test
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. 

- Fri Aug 21, 2009 6:48 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11321 - Sort! Sort!! and Sort!!!
- Replies: 50
- Views: 22130
Re: 11321 - Sort! Sort!! and Sort!!!
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 &qu...
- Wed Aug 12, 2009 4:20 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11097 - Poor My Problem! :-(
- Replies: 8
- Views: 5858
Re: 11097 - Poor My Problem! :-(
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 ...
- Wed Jul 29, 2009 3:55 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11526 - H(n)
- Replies: 49
- Views: 17911
Re: 11526 - H(n)
To kabir, don't forget there might be negative numbers given in the input set. 

- Sun Jul 19, 2009 3:37 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11063 - B2-Sequence
- Replies: 73
- Views: 41954
Re: 11063 - B2-Sequence
Sorry, code removed
Hi saiful.. These are the cases for you:
None of them is b2 sequence.

Hi saiful.. These are the cases for you:
Code: Select all
2
2 2
4
1 3 6 9
- Sat Jul 18, 2009 4:29 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11879
Re: 11517 - Exact Change
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!
input:
1
10000
2
9999
9999
output:
19998 2
Hope this helps!
- Sat Jul 11, 2009 10:17 am
- Forum: Volume 111 (11100-11199)
- Topic: 11105 - Semi-prime H-numbers
- Replies: 16
- Views: 12585
Re: 11105 - Semi-prime H-numbers
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...