Cod sursa(job #1168472)
Utilizator | Neacsu Stefan catelusu12 | Data | 8 aprilie 2014 18:14:47 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
var n,i,nr:longint;
f,g:text;
function prim(x:longint):boolean;
var aux,i:word;
g:boolean;
begin
g:=true;
aux:=trunc(sqrt(x));
for i:=2 to aux do
if x mod i=0 then g:=false;
prim:=g;
end;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
read(f,n);
nr:=2;
for i:=4 to n do
if prim(i)=true then inc(nr);
write(g,nr);
close(f); close(g);
end.