Cod sursa(job #820980)
| Utilizator | Data | 21 noiembrie 2012 15:09:16 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
var f1,f2:text;
n,i,k:longint;
function prim(n:longint):boolean;
var i,k:longint;
begin
k:=0;
for i:=2 to trunc(sqrt(n)) do
if n mod i=0
then inc(k);
prim:=(k=0);
end;
begin
assign(f1, 'ciur.in');
reset(f1);
assign(f2, 'ciur.out');
rewrite(f2);
readln(f1,n);
for i:=2 to n do
if prim(i)
then inc(k);
writeln(f2, k);
close(f2);
end.