Cod sursa(job #153353)
Utilizator | Data | 10 martie 2008 14:25:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
var fi,fo:text;
n,i,j:int64;
prim:array[1..2000010]of byte;
prime:array[1..2000000]of longint;
k,m,ct:longint;
begin
assign(fi,'ciur.in'); reset(fi);
assign(fo,'ciur.out'); rewrite(fo);
read(fi,n);
i:=3;
ct:=1;
while i<=n do
begin
if prim[i]=0 then
begin
j:=i*i;
inc(ct);
while j<=n do
begin
prim[j]:=1;
inc(j,i);
end;
end;
inc(i,2);
end;
writeln(fo,ct);
close(fi);
close(fo);
end.