Cod sursa(job #586803)
Utilizator | UAIC Ion Caliman ion_caliman | Data | 2 mai 2011 22:22:13 |
---|---|---|---|
Problema | NumMst | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
var n,i,j,k,t,max,x,y:longint;
f,g:text;
begin
assign(f,'nummst.in');
assign(g,'nummst.out');
reset(f);
rewrite(g);
read(f,n);
i:=2;
while n mod i<>0 do inc(i);
k:=n div i;
t:=n div i;
x:=n div i;
max:=(n div i)*(n-(n div i)) div (n div i);
while k<n div 2 do
begin
inc(k,t);
if max<k*(n-k) div t then
begin
max:=k*(n-k) div t;
x:=k;
end;
end;
y:=n-k;
writeln(g,x,' ',y);
close(g);
end.