Cod sursa(job #411296)
Utilizator | Nociv Hasis ivanhoe | Data | 4 martie 2010 20:19:13 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
var
t,a,b,i:longint;
function divizor(a,b:longint):integer;
var
aux,rest:longint;
begin
if a<b
then
begin
aux:=a;
a:=b;
b:=aux;
end;
rest:=a mod b;
while rest<>0 do
begin
a:=b;
b:=rest;
rest:=a mod b;
end;
divizor:=b;
end;
procedure facem;
var
f,g:text;
begin
assign(f,'euclid2.in'); assign(g,'euclid2.out');
reset(f); rewrite(g);
readln(f,t);
for I:=1 to t do
begin
readln(f,a,b);
writeln(g,divizor(a,b));
end;
close(f);
close(g);
end;
begin
facem;
end.