Cod sursa(job #369183)
Utilizator | Data | 27 noiembrie 2009 14:37:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
program ciur;
var v:array[2..2000000] of longint;
i,j,n,c:longint;
f,g:text;
begin
assign(f,'ciur.in');
reset(f);
readln(f,n);
close(f);
assign(g,'ciur.out');
rewrite(g);
for i:=1 to n do
v[i]:=0;
for i:=2 to n div 2 do
for j:=2 to n div i do
v[i*j]:=1;
for i:=2 to n do
if v[i]=0 then
c:=c+1;
writeln(g,C);
close(g);
end.