Search found 110 matches

by wyvmak
Mon Apr 29, 2002 2:11 am
Forum: Volume 3 (300-399)
Topic: 300 - Maya Calendar
Replies: 69
Views: 10074

oh, after a few minutes of inspection, you need to add this line after "scanf("%d",&N);":

printf("%d\n",N);
by wyvmak
Mon Apr 29, 2002 1:56 am
Forum: Volume 102 (10200-10299)
Topic: 10268 - 498-bis
Replies: 51
Views: 17934

try to allocate big arrays for both the input string and the coefficients
by wyvmak
Sun Apr 28, 2002 6:05 am
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 22570

At least, as Ivan said, your code seems can accept more than one X - which is not allowed
by wyvmak
Fri Apr 26, 2002 3:58 am
Forum: Volume 3 (300-399)
Topic: 338 - Long Multiplication
Replies: 59
Views: 7599

Thanks

Thanks so so so much. I get Accepted, finally. I guess it could be a year or more since I first attempted this question. It looks that sometimes it's beyond my ability to solve a problem alone.
by wyvmak
Thu Apr 25, 2002 8:50 am
Forum: Volume 3 (300-399)
Topic: 338 - Long Multiplication
Replies: 59
Views: 7599

338 Long multiplication

I got frustrated with this Q, i think i've got (at least) several tens of WA on this single problem already. Would someone tell me what's the output for: 1100 1100 1020 1020 2520 2000 1245 9 9 12345 0 What are other tricky cases? Or any output description not matching the description in the problem?
by wyvmak
Wed Apr 17, 2002 5:25 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 26812

there's a statement in the problem "Which is less then or equals 2^32-1"
i code my solution in C++, but i guess in Java, int would be the same that it cannot hold more than 2^31-1. so maybe try another data type
by wyvmak
Tue Apr 16, 2002 6:36 am
Forum: Volume 7 (700-799)
Topic: 704 - Colour Hash
Replies: 23
Views: 13623

704 - Colour Hash

my program used brute force approach, and got Time Limit Exceeded at 30 secs, yet, in the ranklist, there're submissions which allowed running time to be over a minute, it's weird. is it a trick? if yes, how? nevertheless, on the positive side, i'm thinking how to improve my program to get its runni...
by wyvmak
Sun Apr 14, 2002 5:10 pm
Forum: Volume 1 (100-199)
Topic: 173 - Network Wars
Replies: 29
Views: 2826

so were you accepted?

but my program output for the input:

A:B. C C

should be

Paskill trapped in node C Lisper trapped in node C Both annihilated in node C
by wyvmak
Sun Apr 14, 2002 4:56 am
Forum: Volume 1 (100-199)
Topic: 173 - Network Wars
Replies: 29
Views: 2826

you know, viewing code to find bug is difficult. but, after a problem got AC, i would delete the test input :( but i would suspect: 1. void lmove(int &X) { ... else { for(j=0;j<26;j++) { W[j][X]=0; } X=(X+26-i)%26; } } i didn't change W, though i may not understand why you need it. 2. i think you've...
by wyvmak
Fri Apr 12, 2002 5:49 pm
Forum: Volume 1 (100-199)
Topic: 173 - Network Wars
Replies: 29
Views: 2826

I got AC finally, after a long struggle. the main trick i dealt with is: they may already in the same node in the input, so they'll be 'annihilated' , but also they may get Trapped. In this case, i guess "P trapped Both annihilated" is possible. "P trapped L destroyed" is possible too. like after so...
by wyvmak
Thu Apr 11, 2002 10:00 am
Forum: Volume 6 (600-699)
Topic: 698 - Index
Replies: 21
Views: 8444

698 - Index

:evil: I just hate it when I knew the sample output is wrong. If sample output is wrong, what is its purpose? or in the real ACM, wrong sample output is part of the test for competitors? Yet, I still cannot get AC. would someone be kind enough to give me the output for the following input: abc def a...
by wyvmak
Thu Mar 28, 2002 11:14 am
Forum: Volume 5 (500-599)
Topic: 518 - Time
Replies: 6
Views: 2960

can i have some tricky test cases? coz i get WA in it.
by wyvmak
Tue Mar 26, 2002 6:26 am
Forum: Volume 1 (100-199)
Topic: 132 - Bumpy Objects
Replies: 38
Views: 4804

have you considered "when this line is horizontal, the centre of mass lies above the line and strictly between its endpoints" ? i think it might be the most special sentence in the problem
by wyvmak
Mon Mar 04, 2002 5:21 am
Forum: Volume 2 (200-299)
Topic: 222 - Budget Travel
Replies: 17
Views: 5551

if i haven't overlooked, it seems that the code cannot cope with the case that the last station needs to re-fill the tank.
by wyvmak
Sat Feb 23, 2002 1:29 pm
Forum: Volume 1 (100-199)
Topic: 150 - Double Time
Replies: 18
Views: 3930

would someone give me the output for:

Tuesday 11 January 1600
Thursday 1 March 1900
Monday 1 January 2001

Go to advanced search