Search found 21 matches

by Chow Wai Chung
Sat Jun 19, 2004 5:17 pm
Forum: Volume 5 (500-599)
Topic: 586 - Instant Complexity
Replies: 6
Views: 3964

Thank you very much!!!

I got AC now....made a small mistake b4...thx...
by Chow Wai Chung
Mon Jun 30, 2003 4:40 pm
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 23704

Do you correct with the test data i had posted?? There may be more than one place have 0 cost when me and prof. on the same place.

I also use Dijkstra twice to find minimal cost paths in graph to solved this problem
by Chow Wai Chung
Sun Jun 29, 2003 3:41 pm
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 23704

:lol: :lol: :lol: :lol: :lol: I got AC now!!!! Thank you for your tips, my program have a bug on this test case: 2 Y U B D 0 M U B D 0 B B the correct output should be: 0 B D but i got this: 0 B Thank you very much :wink: ps. 108 and 10000 is offtopic in this volume, but i found you had already solv...
by Chow Wai Chung
Fri Jun 27, 2003 3:47 pm
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 23704

For your data, i have the same output with you. What is the problem? :-? Also, why did you say my program may have the problem on finding the minimum value?? The 'min' you have found may not be the real minmum. if you count it together with the real one, it is wrong! Please tell me clearly, i also w...
by Chow Wai Chung
Mon Jun 23, 2003 3:14 am
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 23704

I still cannot believe that i made a such stupid mistake when two person on the same place :oops:

But after i correct it, i still got WA!!!!!! :evil:

For your second point, i don't know what is your meaning, can you explain more? :-?
by Chow Wai Chung
Thu Jun 19, 2003 3:22 am
Forum: Volume 104 (10400-10499)
Topic: 10449 - Traffic
Replies: 58
Views: 21286

I had solved this problem, my program have some problem on disconnect city before. :oops:
by Chow Wai Chung
Wed Jun 18, 2003 9:56 am
Forum: Volume 104 (10400-10499)
Topic: 10449 - Traffic
Replies: 58
Views: 21286

Dominik, thank you for your remind. But i had search for this problem on this board and consider those mistake may exist on my program before, but i still don't know where is my mistakes, and i found someone ask a new question on this problem, so i add my problem to this thread. If anyone don't mind...
by Chow Wai Chung
Tue Jun 17, 2003 4:27 pm
Forum: Volume 104 (10400-10499)
Topic: 10449 - Traffic
Replies: 58
Views: 21286

I also use bellman-ford to do this problem, but i got many WAs..... I had try many test cases, such as negative cycle, disconnect path.... But i still don't know what is my mistake, can anyone post some test data here??( which may helpful for me to find my mistake and got AC!!) :lol: thank you very ...
by Chow Wai Chung
Mon Jun 16, 2003 2:37 am
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 23704

10171 WA

I use Dijkstra twice to find the cost, then find the mininal cost. In my test cases, i had put some paths with zero cost and zero self loop, and my program seems correct on this. Can anyone point out what are the special cases i missed?? [cpp] #include <stdio.h> int main() { int young[26][26],more[2...
by Chow Wai Chung
Mon Jun 02, 2003 1:45 am
Forum: Volume 103 (10300-10399)
Topic: 10302 - Summation of Polynomials
Replies: 29
Views: 15058

Thank you to turuthok and IIUC GOLD 8)

I solved this problem by using n * n * (n + 1) * (n + 1) /4, may be i lost something when cast the pow() to long long before.
by Chow Wai Chung
Sat May 31, 2003 4:40 am
Forum: Volume 103 (10300-10399)
Topic: 10302 - Summation of Polynomials
Replies: 29
Views: 15058

10302 why WA??

This problem seem very easy, and i use (n*(n+1)/2)^2 to calculate the answer, but i get a WA.... :x Would anyone tell me what is my mistake?? [c] #include <stdio.h> #include <math.h> int main() { long long result,n; while(scanf("%lld",&n)!=EOF) { result=(long long)pow(n*(n+1)/2,2); printf("%lld\n",r...
by Chow Wai Chung
Wed May 28, 2003 3:02 am
Forum: Volume 101 (10100-10199)
Topic: 10147 - Highways
Replies: 67
Views: 20105

I had solved this problem, Thank you
by Chow Wai Chung
Tue May 27, 2003 12:58 pm
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8043

thank you very much to erfan!!!! :D

I got AC now 8)

It looks like i have to improve my maths.
by Chow Wai Chung
Tue May 27, 2003 2:10 am
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8043

isn't it just simple sum all a1*a2*a3.... and mod the number of friend??

but why i got a WA??
by Chow Wai Chung
Mon May 26, 2003 4:30 pm
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8043

10489 Boxes of Chocolates : WA??

This problem seems quite easy, but i got a WA :x I had consider about the overflow problem, and use long long to store some variable. world anyone can point out that where is my mistaker, please?? :oops: [c] #include <stdio.h> int main() { long long total,tmp; int num,n,b,k,box; scanf("%d",&num); wh...

Go to advanced search