Cod sursa(job #587037)
Utilizator | Marin Tiberiu tibi9876 | Data | 3 mai 2011 19:59:03 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
var a:array[1..10000001] of 0..1;
i,n,j,nr:longint;
k:int64;
begin
assign(input,'ciur.in');reset(input);
assign(output,'ciur.out');rewrite(output);
readln(n);
nr:=1;
i:=1;
for i:=1 to trunc(sqrt(n)) div 2 do
if a[i shl 1+1]=0 then
begin
inc(nr);
k:=(i shl 1+1)*(i shl 1+1);
for j:=1 to n div k do
a[j*k shr 1]:=1;
end;
write(nr);
end.