UVa OJ Board

There must be. I also first assumed that the result is regardless of N, and I got WA. Notice that the net is conical, so I think you can place it only so that it is wholly included in the room. Consider the input 100 10 3 0 0 0 1 49 49 I presume the result to be 2, since no way you can cover the poi...

Hello, I get WA on this problem again and again. Maybe I don't understand the problem description. Tell me if I am wrong: 1) There occurs 0 in the input 2) Could I use division , or only +, *, -? Maybe it's posible if there occurs 0 and you can use division -- that would be the reason for yatsen's r...

Hi, Quantris -- this is indeed true. I also changed only the input processing part [ I read integer by integer and have changed it to reading character by character ] and this got AC. Before, my code got WA in 0.000 or 0.002 even if I added a part: [pascal] for i:=1 to 10000000000 do writeln ('gfdgf...

But my code does give correct answer for this and it's still WA

Hello how silly copmuters are :[ When I ran my program on your tests, it gave too few numbers in output [later I realised that when reading from console in Turbo Pascal the maximum length of a string can be 127 :/]. I thought it is because string limit [255] is too small -- so in few minutes I chang...

Oh God

really, now I see
So stupid was I ...
AAAA

Thanks very much!
Kind regards

Hello,

after several submissions I got AC. I would add that the number of numerical characters in judge output and team output has to be the same!
Good luck those who get WA ...

Hello

I've got the same problem. My program works for all test cases I have seen on the board. Despite that I've got WA. Please put more test cases.

With regards

Hi,

do you mean: how many digits will have 10^250? I didn't understand your question.

Hi, I got WA all the time. Can you please give me some test cases? What's the answer for 1 west ? Should it be 3 or 4? I don't paste my code here as it is really long, much longer than ones on the board, I use more complicated method but it should be AC I think... With regards ;) ---This part was ad...

Heyya some hints for those who know the algorithm but got WA [there are some stupid test cases]: 1) The case of the letters matters, 2) Characters '0', '1', ..., '9' are considered as alphabetic ones [not as white spaces], 3) Output 'Blank' only when no characters appear in the line. Finally I got A...

Hi, I can't make out what's wrong with my program :/ I've tested it on all inputs I can think of, I consider the case that two pancakes have the same diameter, but it gives me WA in 0.000 Please help! Check my program or even give me some stupid input ;) [pascal] program miazio; var t, sort:array [1...

Hi,

I don't understand why for input

15
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.01
0.03

there is answer $0.01. Can anybody explain it to me? Any help appreciated. Greetings!

Why does this get WA, I'm going sligtly mad ... [pascal] program miazio; const max = 10000; {} function odl (ax, ay, bx, by:real):real; begin odl:=sqrt (sqr (ax - bx) + sqr (ay - by)); end; {} type mia = record x, y:real; end; var t:array [1..max] of mia; kro:array [1..max] of longint; kolej:array [...

I have WA, but I don't understand why ... I used quicksort & binary search. I knew there exists a quicker algorithm using counting sort , but I would like to know why this gives me WA: [pascal] program miazio; type mia = array [1..10000] of longint; var t:mia; i, j, k, l:longint; le, e, lz, z, kejs:...