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