Pagini recente » Cod sursa (job #1509448) | Cod sursa (job #2750825) | Diferente pentru problema/anagrame intre reviziile 3 si 4 | Cod sursa (job #742320) | Cod sursa (job #1200693)
program euclid2;
var
f1,f2:text;
n,m,k,i:integer;
begin
assign (f1,'euclid2.in');
assign (f2,'euclid2.out');
reset(f1);
rewrite (f2);
readln (f1,m);
for i:=1 to m do begin
readln (f1,n,k);
while (n<>0) and (k<>0) do
if n>k then n:=n mod k else k:=k mod n;
if n=0 then writeln (f2,k) else
writeln (f2,n);
end;
close (f1);
close (f2);
end.