Cod sursa(job #1974762)
| Utilizator |  Bornea Andrei Laurentiu math4 |
Data | 28 aprilie 2017 19:33:49 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 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 do
begin
if a>b then a:=a mod b
else b:=b mod a;
end;
writeln(g,a);
end;
close(f);
close(g);
end.