Cod sursa(job #798838)
| Utilizator | Data | 17 octombrie 2012 13:56:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
var f,g:text;
prim:array[1..32000] of integer;
n,i,j:longint;
begin
assign(f,'ciur.in'); reset(f);
assign(g,'ciur.out'); rewrite(g);
read(f,n); sol:=0;
for i:=2 to i do
if(prim[i]=0) then
j:=i*2;
while(j<=n)do
begin
prim[j]:=1;
j:=j+i;
end;
for i:=2 to i do
if(prim[i]=0) then inc(sol);
write(g,sol);
close(f);
close(G);
END.