Search found 4 matches

by wudanzy
Fri Oct 26, 2007 10:01 am
Forum: Volume 113 (11300-11399)
Topic: 11319 - Stupid Sequence
Replies: 19
Views: 8281

Haha,I got AC,too. I tried again,still used Newton Interpolation.But this time I used doubles instead of integers and check if the output is between 0 and 1000.
by wudanzy
Wed Oct 24, 2007 1:36 pm
Forum: Volume 113 (11300-11399)
Topic: 11319 - Stupid Sequence
Replies: 19
Views: 8281

I used Newton Interpolation in the contest but get wrong answer all the time.Now I know that Newton Interpolation can't get the exact value of a1,a2,,,a6 if I just use Integers.
by wudanzy
Sat Sep 08, 2007 11:00 am
Forum: Volume 112 (11200-11299)
Topic: 11264 - Coin Collector
Replies: 14
Views: 5637

DP

Our team use dynamic programming to slove it in O(n^2) time.
by wudanzy
Wed Sep 05, 2007 3:57 pm
Forum: Volume 112 (11200-11299)
Topic: 11269 - Setting Problems
Replies: 26
Views: 11178

greedy algorithm

I using greedy algorithm. if a[] present the time the first people use to set each problem and b[] for second. if min(ai,aj,bi,bj)==ai or ==bj, then set the ith problem before the jth. Furthermore if min(a1,b1...an,bn)==ak let k be the first one to be solved, or if min(a1,b1...an,bn)==bk let k be th...

Go to advanced search