eadln(gys,gbs); t:=gbs div gys; for i:=trunc(sqrt(t)) downto 1 do if t mod i=0 then begin f:=i;break;end; writeln(f*gys,' ',t div f*gys); gys:最大公约数 gbs:最小公倍数
program sa; var a,b,i,j,n,m,t:integer; begin read(a,b); for i:=a to b do for j:=a to i do if (i-j begin t:=i-j; n:=i; m:=j; end; writeln(n,' ',m); end.