Search found 132 matches

by Revenger
Sun Jul 07, 2002 6:26 pm
Forum: Volume 4 (400-499)
Topic: 445 - Marvelous Mazes
Replies: 93
Views: 10536

445 WA

Why I get WA? [pascal]Program p445; Var Ch : Char; T,i : Integer; begin T:=0; While Not Eof(InPut) Do begin While Eoln(InPut) do begin Writeln; Readln; T:=0; end; Read(Ch); if Ch='!' then begin Writeln; T:=0; end else if Ch in ['0'..'9'] then T:=T+Ord(Ch)-Ord('0') else begin for i:=1 to T do Write(...
by Revenger
Sun Jul 07, 2002 7:13 am
Forum: Other words
Topic: 10314 Three pigs: Bad HTML file !!!
Replies: 2
Views: 2035

Very strange ... :o
by Revenger
Sat Jul 06, 2002 8:38 pm
Forum: Other words
Topic: 10314 Three pigs: Bad HTML file !!!
Replies: 2
Views: 2035

10314 Three pigs: Bad HTML file !!!

Please, reformat 10314.html
In IE 5.0 sections "Input" and "Output" are look like one long long line!!
by Revenger
Sat Jul 06, 2002 6:47 pm
Forum: Volume 4 (400-499)
Topic: 410 - Station Balance
Replies: 41
Views: 15338

Thank you very much!
Of cource, I will delete my code :wink:
by Revenger
Sat Jul 06, 2002 11:56 am
Forum: Volume 4 (400-499)
Topic: 410 - Station Balance
Replies: 41
Views: 15338

It still getting WA :( [pascal]Program p410; Const MaxS = 10; MaxC = 5; Var Inf : Array[1..MaxS]of Integer; Cam : Array[1..MaxC]of Integer; AM,IM : Extended; C,S,i,j,t : Integer; ic,jc,k,p : Integer; ok : Boolean; begin t:=0; While Not Eof(InPut) Do begin :wink: :wink: :wink: :wink: :wink: :wink: :w...
by Revenger
Sat Jul 06, 2002 9:29 am
Forum: Volume 4 (400-499)
Topic: 410 - Station Balance
Replies: 41
Views: 15338

410 Station Balance

Can anyone give me a test on which my program fails? It's get WA, but I think that it is correct. [pascal]Program p410; Const MaxS = 10; MaxC = 5; Var Inf : Array[1..MaxS]of Integer; Cam : Array[1..MaxC]of Integer; AM,IM : Extended; C,S,i,j,t : Integer; ic,jc,k,p : Integer; ok : Boolean; begin t:=0;...
by Revenger
Fri Jul 05, 2002 10:16 am
Forum: Volume 103 (10300-10399)
Topic: 10313 - Pay the Price
Replies: 42
Views: 19461

Thank you very much :D Now I get Accepted for 1 second :D :D :D
by Revenger
Thu Jul 04, 2002 5:28 pm
Forum: Volume 103 (10300-10399)
Topic: 10313 - Pay the Price
Replies: 42
Views: 19461

You wrote : Actually, with this formula ways[i,j] is the ways in which the biggest coin is *less than* or equal to j... not just equal. That's all you need, I'm not sure I understand the problem you're having. I mean that, 1. Ways[i,j] - is the number of ways to pay i dollars using coins less or equ...
by Revenger
Thu Jul 04, 2002 5:13 pm
Forum: Volume 4 (400-499)
Topic: 402 - M*A*S*H
Replies: 56
Views: 13551

Thank you!
And sorry for the third thread on 402 :oops:
by Revenger
Thu Jul 04, 2002 12:46 pm
Forum: Volume 4 (400-499)
Topic: 402 - M*A*S*H
Replies: 56
Views: 13551

402 WA

Can anyone tell me why my program gets WA? [pascal]Program p402; Const MaxN = 100; Var Inf,Card : Array[1..MaxN]of Integer; N,X,i,j : Integer; T,left,k : Integer; begin T:=0; While Not Eof(InPut) Do begin T:=T+1; if T>1 then Writeln; Writeln('Selection #',T); Read(N,X); for i:=1 to 20 do Read(Card )...
by Revenger
Thu Jul 04, 2002 10:25 am
Forum: Other words
Topic: CEOI 2002 Online Contest
Replies: 0
Views: 1480

CEOI 2002 Online Contest

What do you think about CEOI 2002 Online Contest, about their bad site, about their techincal problems, etc ?
by Revenger
Thu Jul 04, 2002 10:18 am
Forum: Other words
Topic: To everybody who practice in CEOI 2002 Online Contest
Replies: 1
Views: 1557

It's great. CEOI organizer check solutions only today - the day of the second round! :x Then they write that there are some technical problems with server and because of this the solution of first round were not checked on compile error and sample test. As they use not a last version of FreePascal. ...
by Revenger
Thu Jul 04, 2002 8:12 am
Forum: Volume 103 (10300-10399)
Topic: 10313 - Pay the Price
Replies: 42
Views: 19461

Formula Ways[i,j]=Ways[i,j-1]+Ways[i-j,j] is known by almost everybody (as I think). Although I wanted to use this formula in the contest, but I have a big problem: This formula only count the ways in which the biggest coin is equal to j; but how can I count the ways in which the number of coin is u...
by Revenger
Wed Jul 03, 2002 6:39 pm
Forum: Volume 103 (10300-10399)
Topic: 10320 - Cow Trouble! Help Please!!
Replies: 27
Views: 10000

Wow! It's great that you have done. But in PASCAL i can not do the same :(
by Revenger
Wed Jul 03, 2002 6:14 pm
Forum: Volume 103 (10300-10399)
Topic: 10320 - Cow Trouble! Help Please!!
Replies: 27
Views: 10000

To Picard:
I just wonder how your program can work only 0.060 seconds! My program work 0.190 seconds. May be you have a very very good formula or C++ is much faster than PASCAL ... :wink:

Go to advanced search