Search found 57 matches

Sun Dec 21, 2003 9:31 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 26856
Thanks, I realy didn`t knew that this problem has new limit. Now I have Accepted
Sun Dec 21, 2003 1:52 am
Forum: Volume 2 (200-299)
Topic: 216 - Getting in Line
Replies: 57
Views: 25915
Sorry, I haven`t ACC for this problem and I can`t understand smth: for input 6 111 84 55 28 43 116 38 101 28 62 5 19 0 answer will be output ********************************************************** Network #5 Cable requirement to connect (111,84) to (43,116) is 91.15 feet. Cable requirement to con...
Sat Dec 20, 2003 8:15 pm
Forum: Volume 1 (100-199)
Topic: 106 - Fermat vs. Pythagoras
Replies: 138
Views: 14809
Oh, hello. Sorry me for worring you
Sat Dec 20, 2003 3:59 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 26856
Sorry, I can`t understand why you solve answer for N>50.
Please, help me why my code get WA.
Fri Dec 19, 2003 11:53 pm
Forum: Volume 1 (100-199)
Topic: 106 - Fermat vs. Pythagoras
Replies: 138
Views: 14809
Hello!
Can anybody give outputs for 1<=N<=20? -I can`t understand what answer will for N=4: 0 4 or 0 2. Thanks.
Fri Dec 19, 2003 9:43 pm
Forum: Volume 1 (100-199)
Topic: 106 - Fermat vs. Pythagoras
Replies: 138
Views: 14809
1)4 3 5
2)12 5 13
3)8 15 17
4)24 7 25
5)20 21 29
6)40 9 41
7)12 35 37
60 11 61
9)28 45 53
10)56 33 65
11)84 13 85
12)16 63 65
13)48 55 73
14)80 39 89
15)36 77 85
16)72 65 97
Fri Dec 19, 2003 6:56 pm
Forum: Volume 3 (300-399)
Topic: 325 - Identifying Legal Pascal Real Constants
Replies: 63
Views: 16488
Hello! Thank you very much. I take into account your message and correct code. But it`s still WA: [pascal]... if s='' then begin writeln(l); continue; end; if (s[1]='e') or (s[1]='E') then delete(s, 1, 1) else begin writeln(i); continue; end; f:=true; if (s[1]='-') or (s[1]='+') then delete(s, 1, 1)...
Fri Dec 19, 2003 3:26 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 26856

Bugs, again bugs...

Hello! Can anybody help why I get WA again and again? Here my code: [pascal]{\$N+} program acm147 (input, output); {Coin change} type T = longint; var s: string; n: T; y: integer; r: double; a2, a4, a10, a20, a40, a100, a200, a400: array [0..1010] of T; procedure make; var i, j, sum, v, vs: T; begin ...
Fri Dec 19, 2003 11:17 am
Forum: Volume 3 (300-399)
Topic: 325 - Identifying Legal Pascal Real Constants
Replies: 63
Views: 16488
Hello Sanya! Thank you for reply. Here my code for this problem: [pascal]program acm325; var n: integer; s, l, i: string; f: boolean; begin { assign(input, 'input.txt'); reset(input); assign(output, 'output.txt'); rewrite(output);} l:=' is legal.'; i:=' is illegal.'; while not eof do begin readln(s)...
Thu Dec 18, 2003 5:08 pm
Forum: Volume 3 (300-399)
Topic: 392 - Polynomial Showdown
Replies: 93
Views: 19968

Where BUG???

I even read all posts about 392 but it`s all the same can`t understand whre bug in my code. Here some inputs and my outputs for this problem: INPUT 0 0 0 1 22 -333 0 1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -7 30 66 0 0 0 0 0 0 1 -3 0 0 0 0 0 0 -1 1 3 -1 -5 0 0 0 -243 0 0 0 -9 -0 -1 -1 ...
Thu Dec 18, 2003 4:02 pm
Forum: Volume 3 (300-399)
Topic: 325 - Identifying Legal Pascal Real Constants
Replies: 63
Views: 16488

325 [Pascal] Why WA?

I don`t know why I get WA. Here some inputs for this problem. Maybe I have incorrect output?! Help me PLEASE!!! INPUT 1E1 1e1 1E 1EE1 1 E1 .1E1 1E.1 1E1.1 ++1E1 1E--1 1.1.1E1 abcd 1 1.1 0e-0 * OUTPUT 1E1 is legal. 1e1 is legal. 1E is illegal. 1EE1 is illegal. 1 E1 is illegal. .1E1 is illegal. 1E.1 i...
Mon Dec 15, 2003 7:19 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 35358
Are you know that this problem has multiple input!? I know this, but have WA. Can somebody help me why it gets WA??? [pascal] program acm482 (input, output); const c = 1000000; var ind: array [1..c] of integer; zn: array [1..c] of string; i, j, n, k: integer; ch: char; begin { assign(input, 'input.t...