OJ Board

I don't know what's wrong with this code .... I got the same result as you, arc16, but still WA could anyone help me ? haven't take a deep look at your program, but my guess is that your program cannot process either a sequencing '\' and '*' characters correctly. Check out the following test case: ...

kuasha wrote:Any one knows what is the causes of Invalid Mamory access (Array boundary overflow etc..)

the program try to access elemen outside your array limit. In other words, your array size is too small.

Is any other trick than I have to print "34" where I found "\s1.234" ?? And what should I print where I found "\S1.123" ?? output should be nothing for \s1.234 and and "S1.123" some tricky case i know is : input: \s3.4a\sb\s.5c\s100.d\s12e \**\\***\\*\*\* output: abcde *\**\* also don't forget that...

if i'm not wrong, you should increase the score if the ball still has a lifetime before you decrease the ball's lifetime. It stated in the desc. As long as the ball has a positive lifetime when it hits a bumper, it obtains the full score for that bumper. so these lines below is not correct :wink: [c...

since your program crash my VC6 :wink: you can try this input by yourself and tell me the output of your program. HOUSE GOOD NOW THING THIS PIGLET MEN TREE BUT WAS AID IN THE IS IT OTHER BEECH ALL VERY AND FOREST COME OF GRAND ON TRESPASSERS FOR PARTY TIME TO MIDDLE LIVED THAT THEMIDDLEOFTHEHOUSEN H...

Is there any formula for this problem?
My solution is by simulating the cell numbering using array, then count the distance between 2 cells using phytagoras. It works well when i test it, but the judge give me WA
if someone have a better algorithm, or formula, please help me.

thanks

yes, i found my bug already, sometime when the last repeated digit is zero, my program mention the number as terminated :wink: btw, i try to send the off solution not to cheat, but because i didn't know that such case is not exist, and i'm really confused why i got WA on this problem. When i saw tha...

yesterday, i found the official solution of this problem on the net (ACM EC94). And... the output is VERY strange. Take a look at this:

I've solve the problem, but then when i submit it, i got RE!!! :( please, if anyone can, take a look at my code, and tell me, why i got RE. [pascal] program uva(input,output); {$IFNDEF ONLINE_JUDGE} uses crt; {$ENDIF} const infile = ''; outfile = ''; {$IFDEF ONLINE_JUDGE} type tInt = integer; {$ELSE...

here is my code, wher the judge always replies compile erroe, but i can't find the bug. thanx in advance. your program seems ok to me. I think the small problem is: 1. Do not put a newline in the last case. The output will consist of the same lines and words as the input file. However, the letters ...

the problem is simple, but i got WA
is there any tricky case?

me too
anyway, is 0e-0 legal or illegal?

thanks for reply. I fixed the thing you mention, but still WA
some question:
1. what is the output for: 2. should i print blank line in the last case or not?
thank you

have you test it before submit it? this is the output your program (in Visual C++): 10 0! -- (0) 0 (1) 0 (2) 0 (3) 0 (4) 0 (5) 0 (6) 0 (7) 0 (8) 0 (9) 0 100 0! -- (0) 0 (1) 0 (2) 0 (3) 0 (4) 0 (5) 0 (6) 0 (7) 0 (8) 0 (9) 0 366 0! -- (0) 0 (1) 0 (2) 0 (3) 0 (4) 0 (5) 0 (6) 0 (7) 0 (8) 0 (9) 0 5 0! --...

i got WA too don't know what's wrong
btw, what is the output for 1 1 ?

[pascal]
[/pascal]