Cod sursa(job #287055)
Utilizator | Data | 24 martie 2009 15:22:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | aa | Marime | 0.31 kb |
var v:array[1..1300100] of byte;
n,i,j,s,k:longint;
begin
assign(input,'ciur.in'); reset(input);
assign(output,'ciur.out'); rewrite(output);
readln(n);k:=13*n;
for i:=2 to trunc(sqrt(k)) do
if v[i]=0 then for j:=2 to k div i do v[i*j]:=1;
for i:=1 to n do s:=1-v[i];
close(input); close(output);
end.