Cod sursa(job #1655183)
Utilizator | Data | 17 martie 2016 20:16:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
function gcd(a, b:qword):qword;
begin
if (b = 0) then
gcd:=a
else
gcd:=gcd(b, a mod b);
end;
var x,y,i,n:qword;
begin
assign(input,'euclid2.in');
reset(input);
assign(output,'euclid2.out');
rewrite(output);
read(n);
for i:=1 to n do
begin
read(x,y);
writeln(gcd(x,y));
end;
end.