Cod sursa(job #679840)
Utilizator | Data | 13 februarie 2012 19:44:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
var a:array[1..2000000] of boolean;
f,g:text;
n,i,j,x:longint;
begin
assign(f,'eratostene.in');reset(f);
assign(g,'eratostene.out');rewrite(g);
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;
x:=0;
for i:=2 to n do
if a[i]=true then x:=x+1;write(g,x);
close(g);end.