OJ Board

Sorry, I know java very and very bad. All that I can help you is my algo: 1) read input to array a[1..n] of integer 2) create other array b[1..n] of boolean for i=1 to n-1 do if |a[i] - a[i+1]|>=n then /Not jolly/ else b[|a[i] - a[i+1]|]:=true for i=1 to n-1 if not b[i] then /Not jolly/ else {if b[i...

I use algorithm that 1) read input to g: array [1 .. n, 1 .. n] of boolean where g[i, j]=true if [i, j]='@'. 2) for this problem graph consists of nodes(=g) and two nodes [i1, j1] & [i2, j2] joined if |i1-12|<=1 and |j1-j2|<=1. 3) for this graph I start BFS. I think that it is right algorithm. B...

Hm... You have very big code and I can't understand it. Please write steps of algo that you program do.

No, I think that Sohel has problem in other way ( in my program I used array [1 .. 500] and get AC).
Sohel, maybe your program write zeros at the begin of line or at the end of it.

Oh, yes, of course It's really very easy.
Thank you very much, now I have got AC on 10533 in 5 sec.

Hi! I have TLE on this problem, but I don't know how I can make my program faster. I have algo that: 1) get_primes_numbers (Eratosphean) 2) get_digit_primes_numbers It makes d: array [1 .. 1000000] of boolean and d =true if i - digit prime. And this two procedures works <1 sec. !!! It means that ver...

I have AC on this problem and if you want I can help you:
give me some inputs and I will give you right outputs.

I think that with <const t> and different <Radius of big circle> we will have different answers

I know the trick of finding the repeated sequence of [the last digit of m] poweres n to get the same correct answer, but could anyone please explain why the last two digits of n is enough? You can explain (on paper) that all periods of last digit are 1, 2 or 4 - for different digit. And it is enoug...

As I understand if in input "t" then write “Impossible.” else write area of grey part. Am I right???

It's very funny: the name of problem is 500!, but you must to solve 1000! I had got 3 WA before find that input can has nubers>500.

Why WA? My program doesn't build tree, it only sort strings (like 'LR', 'LLL' etc). I think it is enough to solve this problem. But my program has some bug. Please help me to find it. [pascal] Program acm122; {About BIN trees} const kolichestvo = 300; type types = array [0 .. kolichestvo] of string;...

I have already siad that this problem have multiple input. If you didn't know what it meens you can see it at http://acm.uva.es/problemset/minput.html

Hi, kiha. You can't use only readln becouse this problem have multiple input! and if you don't check that s<>'' then program reads all input file as one case and of course you will have WA. About algo of this problem you can read here: http://www.comp.nus.edu.sg/~stevenha/programming/prog_dp1.html c...

Val(s: string, n: integer, code: integer) is procedure that do:
n:=integer(s).
Example: If s='123' then n -> 123;
If s -- integer than code = 0
else code = position where were error.
n can be also byte, longint, real etc