Cod sursa(job #1416207)
Utilizator | Data | 7 aprilie 2015 17:02:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
const
f1='euclid2.in';
f2='euclid2.out';
function gcd(a,b:longint):longint;
begin
if b=0 then gcd:=a
else gcd:=gcd(b,a mod b);
end;
var t,i,a,b:longint;
begin
assign(input,f1); reset(input);
assign(output,f2); rewrite(output);
readln(t);
for i:=1 to t do begin
readln(a,b);
writeln(gcd(a,b));
end;
close(input);
close(output);
end.