Cod sursa(job #695806)
| Utilizator |  Igna Darius ignadarius |
Data | 28 februarie 2012 14:54:10 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
var g,f:text;j,n,k:integer;a:array[1..200000]of boolean;i.n:longint;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
read(f,n);
k:=0;
for i:=1 to n do
a[i]:=true;
for i:=2 to n do
for j:=2 to n div i do
a[i*j]:=false;
for i:=2 to n do
if a[i]=true then k:=k+1;
write(g,k);
close(f);
close(g);
end.