Cod sursa(job #264324)
Utilizator | Data | 21 februarie 2009 21:47:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
var i,n,a,b:longint;
f,g:text;
function gcd(a,b:longint):longint;
begin
if b=0 then gcd:=a
else gcd:=a mod b;
end;
begin
assign(f,'euclid2.in');
reset(f);
assign(g,'euclid2.out');
rewrite(g);
readln(f,n);
for i:=1 to n do begin
readln(f,a,b);
writeln(g,gcd(a,b));
end;
close(f);
close(g);
end.