Search found 146 matches

by hank
Wed Feb 12, 2003 4:23 pm
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24638

The judge's testdata is wrong.
But there still were some people got AC last month.
It's very strange!
How can they got AC?
by hank
Mon Feb 10, 2003 1:54 pm
Forum: Volume 1 (100-199)
Topic: 191 - Intersection
Replies: 103
Views: 18832

output:

Code: Select all

F
F
F
T
T
F
T
F
F
F
T
T
F
T
F
F
F
T
T
F
T
F
F
F
T
T
F
T
F
F
F
F
F
F
F
F
F
F
F
F
F
F
F
F
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
T
good luck~ :P
by hank
Mon Feb 10, 2003 1:53 pm
Forum: Volume 1 (100-199)
Topic: 191 - Intersection
Replies: 103
Views: 18832

Here are some testdata. input: 68 4 9 11 2 1 1 7 5 11 2 4 9 1 1 7 5 12 12 24 24 19 5 25 17 4 6 15 9 1 1 11 11 19 5 25 17 12 12 24 24 0 18 8 12 1 1 11 11 2 4 4 2 1 1 11 11 -4 9 -11 2 -1 1 -7 5 -11 2 -4 9 -1 1 -7 5 -12 12 -24 24 -19 5 -25 17 -4 6 -15 9 -1 1 -11 11 -19 5 -25 17 -12 12 -24 24 0 18 -8 12...
by hank
Mon Feb 10, 2003 11:07 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24638

[c]#include "stdio.h" #include "string.h" #include "stdlib.h" #define MAX 1000 int n; int src[MAX+1],dest[MAX+1]; int totalcost,process[(MAX+1)*100][2],list; void output() { int i,p,q; printf("%d\n",totalcost); for(i=0;i<=list;i++){ p=process [0]; q=process [1]; if( p > q && q!=-1) p^=q^=p^=q; if(p!...
by hank
Mon Feb 10, 2003 8:53 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24638

how can you get AC?
can you tell me what's wrong?
by hank
Mon Feb 10, 2003 7:07 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24638

I also got WA many times!
Can you tell me how can I get AC?
by hank
Mon Feb 10, 2003 6:50 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24638

I also got WA many times,but I still can't find any bug in my program!
any idea?
by the way,
How did you know the judge's testdata is wrong?
by hank
Fri Feb 07, 2003 4:17 pm
Forum: Volume 5 (500-599)
Topic: 565 - Pizza Anyone?
Replies: 12
Views: 4307

565 - Pizza Anyone?

I can't understand what the problem said!!

the input

Code: Select all

+A+B+C+D-E-F-G-H;
-A-B+C+D-E-F+G+H;
-A+B-C+D-E+F-G+H;
I don't know why the output is

Code: Select all

Toppings:
and
input

Code: Select all

+A+B+C+D;
+E+F+F+H;
+A+B-G;
+O+J-F;
+H+I+C;
+P;
+O+M+L;
+M-L+P;
why the output is

Code: Select all

Toppings: CELP
please help me!
by hank
Thu Feb 06, 2003 12:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 20811

hi
I have some questions about this problem.

Code: Select all

if the inpu is:

4
-1 3
0 1
0 2
2 3
3 4
0 0

what should I print?
-------------------------------
and if the input is:

4
0 1
1 20
1 19
0 0

what should I print?
by hank
Fri Jan 31, 2003 4:31 pm
Forum: General
Topic: what going wrong ?
Replies: 1
Views: 1354

Which problem ?
by hank
Fri Jan 31, 2003 4:24 pm
Forum: Volume 1 (100-199)
Topic: 146 - ID Codes
Replies: 35
Views: 5885

input: CBABA
output should be "CBBAA" !
by hank
Thu Jan 30, 2003 11:04 am
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 32768

10032 Tug of War [WA,need test!]

hi~ I always got wrong answer! I didn't find any bug. I use Greedy Algorithm to use this problem. Please give me some test data of this problem. (I think it well be helpful~) [c] #include "stdio.h" #include "stdlib.h" #define MAX 10000 int man[120]; void solve(int n) { int i,j,k,p,amt=0,max,min; int...
by hank
Thu Jan 30, 2003 10:48 am
Forum: Volume 100 (10000-10099)
Topic: 10003 - Cutting Sticks
Replies: 59
Views: 24795

I can't understand what the problem said.
Anybody can tell me? :cry:
by hank
Wed Jan 29, 2003 3:36 pm
Forum: Volume 101 (10100-10199)
Topic: 10132 - File Fragmentation
Replies: 24
Views: 11387

10132 File Fragmentation WA!~

I got Wrong Answer. But I can't find the wrong. Anybody can give me some test data of problem 10132? I think it will be helpful. Thanks! [c]#include "stdio.h" #include "string.h" #define MAX 2080 struct{ int data[MAX]; int length; int used; }f[300]; int n,len,stop; int intcmp(int a[],int i,int j) { ...
by hank
Mon Jan 27, 2003 12:36 pm
Forum: Volume 5 (500-599)
Topic: 524 - Prime Ring Problem
Replies: 74
Views: 19532

rury wrote:My program gives 81024 lines in number 16, too.
But.. I got reply - "output limit exceeded".
Why?
I don't think there is the number "16" in the judge's test data. :D

Go to advanced search