Search found 13 matches

by dabendan
Fri Dec 13, 2002 12:49 pm
Forum: Volume 5 (500-599)
Topic: 532 - Dungeon Master
Replies: 39
Views: 10055

my program don't work when the 3 numbers in the input are even and the maze is empty.
ex:
2 2 2
S.
..

..
.E

however I fixed it and got ac.
by dabendan
Sat Dec 07, 2002 6:08 pm
Forum: Volume 101 (10100-10199)
Topic: 10188 - Automated Judge Script
Replies: 58
Views: 30856

what is the output if my input is:
3
Input Set #1: YES
Input Set #2: NO
Input Set #3: NO
4
123
ABCDE FG
hij k
lmn
0
by dabendan
Wed Nov 27, 2002 10:51 am
Forum: Volume 5 (500-599)
Topic: 532 - Dungeon Master
Replies: 39
Views: 10055

Here is my code. My output format is wrong? My algorithm is wrong? I can't figure out. [c]#include <stdio.h> #include <stdlib.h> #define MAX 32767 long l,r,c; char a[32][32][32]; long queue[MAX][4]; long left,right; int Add_queue(long,long,long,long); int Get_queue(long *); int main() { void Input()...
by dabendan
Wed Nov 27, 2002 10:29 am
Forum: Volume 5 (500-599)
Topic: 532 - Dungeon Master
Replies: 39
Views: 10055

It passed for the sample cases, but I still get WA.
I use BFS and can't find any problem.
by dabendan
Wed Nov 27, 2002 10:23 am
Forum: Volume 3 (300-399)
Topic: 302 - John's trip
Replies: 20
Views: 4893

If I use brutal force , I'll get TLE.
If you succeed, please give me a hint.
thanks a lot. :D
by dabendan
Wed Nov 27, 2002 10:19 am
Forum: Volume 3 (300-399)
Topic: 398 - 18-Wheeler Caravans (aka Semigroups)
Replies: 2
Views: 1902

Thanks a lot. :D
It's my mistake.
I should review my code more carefully.
by dabendan
Thu Nov 21, 2002 2:15 am
Forum: Volume 3 (300-399)
Topic: 302 - John's trip
Replies: 20
Views: 4893

302 john's trip

The first street you are reading is the street where john lives. Example input: 3 1 6 1 2 1 2 3 2 2 4 3 4 5 4 5 2 5 5 3 9 5 6 7 6 3 8 0 0 1 1 1 0 0 0 0 john lives in street 3 1 at junction 1. Output should be: 1 2 8 7 4 3 5 9 6 1 How could I get a sequence of street numbers is lexicographically the...
by dabendan
Thu Nov 21, 2002 2:02 am
Forum: Volume 5 (500-599)
Topic: 532 - Dungeon Master
Replies: 39
Views: 10055

532 Dungeon Master

I got wa so many times.
I hope someone can give me an example to help me debug my program.
by dabendan
Fri Nov 01, 2002 7:31 pm
Forum: Volume 3 (300-399)
Topic: 302 - John's trip
Replies: 20
Views: 4893

How could I get a sequence of street numbers is lexicographically the smallest ?
by dabendan
Fri Oct 18, 2002 7:46 am
Forum: Volume 3 (300-399)
Topic: 398 - 18-Wheeler Caravans (aka Semigroups)
Replies: 2
Views: 1902

398 - 18-Wheeler Caravans (aka Semigroups)

Is there any trick in problem 398 ? I can't find any problem. My output is totally the same with sample output. [c]#include <stdio.h> #include <stdlib.h> char a[30][30]; char node[30]; int n; int started=0; int main() { int index; void Input(); void Display(); void Proceed(); while(1) { Input(); Dis...
by dabendan
Thu May 30, 2002 7:29 am
Forum: Volume 3 (300-399)
Topic: 300 - Maya Calendar
Replies: 69
Views: 9875

When I copied my codes from file to Outlook Express 5. It cut my code like that: [c]#include <stdio.h> #include <string.h> long int mon,day,year; long now; int main() { char b[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","mulu k","ok","chuen","eb","ben","ix","mem","cib","caba...
by dabendan
Wed May 29, 2002 6:41 pm
Forum: Volume 3 (300-399)
Topic: 300 - Maya Calendar
Replies: 69
Views: 9875

?!

That's strange.
I copied my code from here and sent it then I got accept.
But when I sent it from my file then I got wrong answer.
I couldn't find any differences. :roll:
by dabendan
Tue May 28, 2002 9:27 pm
Forum: Volume 3 (300-399)
Topic: 300 - Maya Calendar
Replies: 69
Views: 9875

300

I got wrong answer. I can't find the wrong. [c]#include <stdio.h> #include <string.h> long int mon,day,year; long now; int main() { char b[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; int n; int...

Go to advanced search