Cod sursa(job #1185730)
| Utilizator |  Stefan Neacsu stef2014 |
Data | 16 mai 2014 17:08:42 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
var n,x,k:longint;
i,j:longint;
a:array[1..100000]of longint;
begin
read(x);
j:=0;
for i:=1 to x-1 do
a[i]:=i;
k:=2;
repeat
for j:=2 to x div k do
if (a[j*k]<>0) and (a[j*k] mod k=0) then a[j*k]:=0;
k :=k+1;
until k=x;
n:=0;
for j:=2 to x do
if a[j]<>0 then n:=n+1;
write(n);
end.