Cod sursa(job #820979)
Utilizator | Data | 21 noiembrie 2012 15:08:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
var f1,f2:text;
n,i,k:longint;
function prim(n:longint):boolean;
var i,k:longint;
begin
k:=0;
for i:=2 to trunc(sqrt(n)) do
if n mod i=0
then inc(k);
prim:=(k=0);
end;
begin
assign(f1, 'ciur.in');
reset(f1);
assign(f2, 'ciur.out');
rewrite(f2);
readln(f,n);
k:=0;
for i:=2 to n do
begin
p:=0;
for i:=1 to n do
end;
close(f2);
end.