Cod sursa(job #154876)
Utilizator | Data | 11 martie 2008 15:52:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
var a,b:int64;
n:integer;
begin
assign(input,'euclid2.in');
assign(output,'euclid2.out');
reset(input);
rewrite(output);
readln(n);
for i:=1 to n do
begin
readln(a,b);
while (a<>0) and (b<>0) do
begin
if a>b then a:=a mod b
else b:=b mod a;
end;
if a=0 then write(b)
else write(a);
end;
close(input);
close(output);
end.