Cod sursa(job #935547)
Utilizator | Data | 3 aprilie 2013 21:11:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
Program eratosthenes;
var
i,n,j,k,rad:longint;
prim:boolean;
cin,cout:text;
begin
assign(cin,'ciur.in');reset(cin);
assign(cout,'ciur.out');rewrite(cout);
read(cin,n);
k:=0;
for i:=2 to n do
begin
prim:=true;
rad:=0;
repeat
rad:=rad+1;
until rad>=i;
rad:=rad-1;
for j:=2 to rad do
begin
if (i mod j=0) then
prim:=false;
end;
if (prim=true) then
k:=k+1;
end;
writeln(cout,k);
close(cin);
close(cout);
end.