Cod sursa(job #342180)
Utilizator | Data | 20 august 2009 19:00:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
var i,j,a,z,ii:longint;
t,te:text;
begin
assign(t,'euclid2.in'); reset(t);
assign(te,'euclid2.out'); rewrite(te);
readln(t,z);
for ii:=1 to z do
begin
readln(i,j);
if j>i then
begin
a:=j;
j:=i;
i:=a;
end;
repeat
begin
a:=j;
j:=i mod j;
i:=a;
end;
until j=0;
writeln(te,i);
end;
close(te);
end.