Cod sursa(job #763040)
| Utilizator | Data | 30 iunie 2012 21:07:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
program ciur;
var n,i,j,k:integer;
a:array[1..1000000] of boolean;
fi,fo:text;
begin
assign(fi,'ciur.in');reset(fi);
assign(fo,'ciur.out');rewrite(fo);
read(fi,n);
for i:=1 to n do a[i]:=true;
for i:=2 to n do
if a[i] then for j:=2 to n div i do a[i*j]:=false;
for i:=2 to n do
if a[i] then inc(k);write(fo,k);
close(fi);close(fo);
end.
