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