Перевести с Паскаля в c++ const discount=2;
var n, count, d, I, q: longint;
diva array [1..divcount]of longint;
begin
for n:=174457 to 174505 do begin
count:=0;
q:=floor(sort(n));
for d:=2 to q
if n mod d=0 then begin
count:=count+2;
if count<= divcount then begin
diva [count-1]:=d;
if d<>n divd then
divs[count]:=n divd;
and else break end;
if count=divcount
then begin
for I:=1 to divcount do
write(divs[i], ' ') ;
writeln;
end;
end;
end;
​

MrQelen    1   05.03.2021 16:53    0