Search found 7 matches

by przygoda
Tue Sep 07, 2004 9:32 am
Forum: Volume 107 (10700-10799)
Topic: 10710 - Chinese Shuffle
Replies: 19
Views: 4610

10710

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 m...
by przygoda
Wed Apr 07, 2004 4:58 pm
Forum: Volume 103 (10300-10399)
Topic: 10398 - The Golden Pentagon
Replies: 17
Views: 3847

10398 Golden Pentagom

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
by przygoda
Fri Mar 14, 2003 3:58 pm
Forum: Volume 104 (10400-10499)
Topic: 10403 - Escape from Tut's Tomb
Replies: 8
Views: 4641

it is possible to use capital letters ???
by przygoda
Sun Mar 09, 2003 12:56 am
Forum: Volume 104 (10400-10499)
Topic: 10472 - Fastest Vs Cheapest
Replies: 17
Views: 7880

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 :evil:
by przygoda
Fri Aug 09, 2002 12:36 pm
Forum: Volume 3 (300-399)
Topic: 382 - Perfection
Replies: 95
Views: 19210

382

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; pom:=(liczba div 2 )...
by przygoda
Fri Aug 09, 2002 12:33 pm
Forum: Volume 1 (100-199)
Topic: 118 - Mutant Flatworld Explorers
Replies: 68
Views: 9251

118 - Mutant Flatworld Explorers

[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; 'W' : poz:=4; end; ...
by przygoda
Fri Aug 09, 2002 12:31 pm
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 36147

116 - Unidirectional TSP

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 begin k[i,j,1]:=...

Go to advanced search