Cod sursa(job #1361629)
| Utilizator | Data | 25 februarie 2015 22:35:30 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
program ciur;
var v:array[1..2000000] of 0..1;
i,n,j,nr:longint;
begin
assign(input,'ciur.in'); reset(input);
assign(output,'ciur.out'); rewrite(output);
readln(n);
nr:=1;
for i:=3 to n do
begin
if i mod 2=0 then v[i]:=1
else
if (v[i]=0) then
begin
inc(nr);
j:=i;
while j<n do
begin
v[j]:=1;
j:=j+i;
end;
end;
end;
writeln(nr);
close(input); close(output);
end.
