Cod sursa(job #410994)
| Utilizator |  dobre alex axel15 |
Data | 4 martie 2010 17:56:15 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
var a:array[1..1000000000] of 0..1;
f,g:text;
i,j,b,n,nr:longint;
begin
assign(f,'intrare.in'); reset(f);
assign(g,'iesire.out'); rewrite(g);
read(f,n);
for i:=2 to n do begin
for j:=2 to n do begin
b:=j*i;
a[b]:=1;
end; end;
for b:=1 to n do
if a[b]=0 then nr:=nr+1;
write(g,nr);
close(g);
close(f);
end.