Cod sursa(job #433201)
| Utilizator | Data | 3 aprilie 2010 14:29:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
var a:array [1..2000000] of boolean;
n,k,d,i:integer;
f,g:text;
begin
assign(f,'ciur.in');
reset(f);
readln(f,n);
close(f);
d:=0;
for i:=1 to n do
a[i]:=true;
k:=4;
repeat
a[k]:=false;
k:=k+2;
until k>n;
k:=6;
repeat
a[k]:=false;
k:=k+3;
until k>n;
k:=10;
repeat
a[k]:=false;
k:=k+5;
until k>n;
k:=14;
repeat
a[k]:=false;
k:=k+7;
until k>n;
for i:=2 to n do
if a[i]=true then inc(d);
assign(f,'ciur.out');
rewrite(f);
writeln(f,d);
close(f);
end.
