分数計算

program euclid(input,output); var x,y:integer; function gcd(u,v:integer):integer; var t:integer; begin repeat if u<v then begin t:=u; u:=v; v:=t end; u:=u-v until u=0; gcd:=v end; { gcd } begin while not eof do begin readln(x,y); if (x>0) and (y>0) then writeln(x,y,gcd(x,y)) end; end.