OJ Board

Hi.
I'm looking for your help. I tried to solve problem 10710, but still i have no idea. The range of number n is very big . I see that not only prime numbers are good candidates for Jimmy-number. I found also 341,561,645,1105,.. I can't find a good method to generate all this numbers. Please give ...

hello,
i have a problem with getting the picture of this problem .
it's possible for you to send me it .
thanks Martin

Przygoda

przygoda@jessie.lonet.gdynia.pl

it is possible to use capital letters ???

okey , I found the solution , but i think i have a small mistake in my code , it is possible for anybody to give me some interestin input-s with output-s .
Tnaks very much Martin

Please help me !!!
What is wrong ???
:evil:

[pascal]

program glupii;
var
liczba,z,sumka,la,i,pom,u:longint;


begin

writeln('PERFECT OUTPUT');

while not eoln do begin
read(liczba);
if liczba=1 then begin
writeln(' ',1,' DEFICIENT');
continue;
end;
sumka:=0;
if liczba=0 then break ...

[pascal] :oops:
Please help .
I have got WA .
Here is my code

program ogrod;

var
i,ilosc,pom,poz,x1,y1,x,y:longint;
z:char;
lost:boolean;
t:array[1..200,1..3] of byte;

begin
readln(x,y);
while not eof do begin
readln(x1,y1,z,z);
case z of
'N' : poz:=1;
'E' : poz:=2;
'S' : poz:=3 ...

Please help me
What is wrong with my code ???


[/pascal]
program od_nowaaaa;

var
t:array[1..10,1..110] of longint;
k:array[1..10,1..110,1..2] of longint;
i1,min,pom,n,m,i,j,a:longint;
wynik,posrednik:array[1..110] of longint;

procedure prepare;
begin

for i:=1 to n do
for j:=1 to m do ...