Search found 5 matches

by tokei
Mon Oct 07, 2002 4:34 pm
Forum: Volume 4 (400-499)
Topic: 430 - Swamp County Supervisors
Replies: 8
Views: 3255

430 - Swamp County Supervisors

Hi!

I had no idea how to solve this problem efficiently....
I used DFS to solve this problem, but it seemed that my program ran too slow....

Can anyone help me to solve this problem efficiently ?

Thanks in advance!
by tokei
Mon Oct 07, 2002 4:28 pm
Forum: Volume 4 (400-499)
Topic: 451 - Poker Solitaire Evaluator
Replies: 18
Views: 4680

Did you handle the case that the straight could be as follows?

AH 2S JH QH KD
by tokei
Sun Sep 29, 2002 12:48 am
Forum: Volume 4 (400-499)
Topic: 431 - Trial of the Millennium
Replies: 13
Views: 6927

431 - Trial of the Millennium

Hmmm .... I was wondering how to solve this problem. First, I try to solve this problem like a 0/1 knapsack problem. However, after I found the maximum points and the optimal number of evidence presentations within the time constraint, I had another problem which is how to find the sequence of the e...
by tokei
Tue Aug 20, 2002 8:14 pm
Forum: Volume 103 (10300-10399)
Topic: 10325 - The Lottery
Replies: 14
Views: 6307

Actually, my program produces the correct answer for the above test case. However, I still do not understand why my program could not get accepted. >_< Here is my code: [cpp] #include <stdio.h> #include <math.h> long long int save[100],used[100],num[100]; long long int result,m,n; long long int gcd(...
by tokei
Tue Aug 20, 2002 7:33 am
Forum: Volume 103 (10300-10399)
Topic: 10325 - The Lottery
Replies: 14
Views: 6307

10325 Lottery - W.A.

I am gonna go nuts because of this problem....
I got W.A 12 times.....

Can anyone give me some test cases to help me?

Thanks in advance.

Go to advanced search