Cod sursa(job #2342836)
Utilizator | Data | 13 februarie 2019 13:26:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
var a,b,t,r,i,aux:longint;
fin,fout:text;
BEGIN
assign(fin,'euclid2.in');
reset(fin);
assign(fout,'euclid2.out');
rewrite(fout);
readln(fin,t);
writeln(t);
for i:=1 to t do
begin
readln(fin,a,b);
if b>a then
begin
aux:=a;
a:=b;
b:=aux;
end;
repeat
r:=a mod b;
a:=b;
b:=r;
until r=0;
writeln(a)
end;
close(fin);
close(fout);
END.