Cod sursa(job #1974763)
Utilizator | Data | 28 aprilie 2017 19:41:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
var f,g:text;
n,i:longint;
a,b:int64;
begin
assign(f,'euclid2.in');
assign(g,'euclid2.out');
reset(f);
rewrite(g);
read(f,n);
for I:=1 to n do
begin
read(f,a);
read(f,b);
while ((a<>b) and (b>0) and (a>0)) do
begin
if a>b then a:=(a mod b)
else b:=(b mod a);
end;
if a>0 then writeln(g,a)
else writeln(g,b);
end;
close(f);
close(g);
end.