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