|
|
back to boardCommon BoardPlease, give me test for problem about idempotents (I've got Time Limit) Why Time limit? Pls, give me a test. program idempotent; var K : integer; N : longint; p,q : longint; i,j : longint; min : longint; ia: integer; t : longint; begin readln(k); for ia:=1 to k do begin readln(n); if n mod 2 = 0 then begin q:=2; p:=n div 2; end else begin t:= trunc(Sqrt(n)); j:=3; while j<=t do begin if n mod j = 0 then begin q:=j; p:=n div j; break; end; j:=j+2; end {while} end; i:=0; while (i*p <n ) do begin if (i*p mod q = 1) or (i*p mod q = 0) then Write(i*p,' '); if ((i*p+1) mod q = 1) or ((i*p+1) mod q = 0) then Write (i*p+1,' '); inc(i); end; Writeln; end; end. |
|
|