Cod sursa(job #245324)
Utilizator | Jecan Daniel Valerian jdv | Data | 17 ianuarie 2009 18:55:52 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 50 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
{ cel mai mare divizor comun }
program divizor;
var a,b,t:longint;
i:integer;
f,g:text;
function cmmdc(a,b:longint):longint;
begin
while (a>0)and(b>0) do
if a>b then a:=a-b
else b:=b-a;
cmmdc:=a;
end;
begin
assign(f,'euclid2.in'); reset(f);
assign(g,'euclid2.out'); rewrite(g);
readln(f,t);
for i:=1 to t do begin
readln(f,a,b);
writeln(g,cmmdc(a,b));
end;
close(f);
close(g);
end.