Cod sursa(job #2428631)
| Utilizator |  Arteni Cristi Arteni_Cristi |
Data | 5 iunie 2019 22:15:35 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.17 kb |
var n,i,a,b:longint;
begin
readln(n);
for i:=1 to n do
begin
readln(a,b);
while a*b<>0 do
if a>b then a:=a mod b else b:=b mod a;
writeln(a+b)
end
end.
