Cod sursa(job #170244)
| Utilizator |  Glodeanu Ioan Daniel DanielG |
Data | 2 aprilie 2008 16:16:31 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
var r,a,b:int64;
f,g:text;
t,i:longint;
procedure diviz(a,b:int64):int64;
begin
if b=0 then diviz:=1
else diviz:=diviz(b,a mod b);
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,diviz(a,b));
end;
close(f);
close(g);
end.