Cod sursa(job #955873)
Utilizator | Data | 1 iunie 2013 17:38:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
var a:array[1..100000,1..2] of longint;
r, i, n:longint;
j:integer;
begin
assign(input,'euclid2.in');
assign(output,'euclid2.out');
reset(input);
rewrite(output);
readln(n);
for i:=1 to n do
for j:=1 to 2 do
read(a[i,j]);
for i:=1 to n do
begin
r:=a[i,1] mod a[i,2];
while r<>0 do
begin
a[i,1]:=a[i,2];
a[i,2]:=r;
r:=a[i,1] mod a[i,2];
end;
writeln(a[i,2]);
end;
close(input);
close(output);
end.