Pagini recente » Cod sursa (job #457996) | Cod sursa (job #2272383) | Concurs-mihai-patrascu-2013/clasament | Cod sursa (job #439474) | Cod sursa (job #2515700)
program fractii;
var
n, i,j, num, z,x,k,m: longint;
in_f, out_f: text;
t: array[1..1000000] of boolean;
ok: boolean;
begin
assign(in_f, 'fractii.in');
assign(out_f, 'fractii.out');
reset(in_f);
readln(in_f, n);
for i := 1 to n do t[i] := true; {se creeaza un tablou cu elemente de tip boolean}
for i := 2 to n do
if t[i] = true then
begin
x:=0;
writeln('i= ',i);
for j := 2 to n div i do
begin
t[i * j] := false;
writeln(i * j);
inc(x);
m:=x;
if(x>=1) then
for k:=1 to m do
num+=n-2;
end;
num:=num+(n-x-1);
writeln;
writeln(n-x-1);
writeln;
end;
write(num+n);
rewrite(out_f);
write(out_f, num);
close(out_f);
end.