Cod sursa(job #154273)
| Utilizator |  Muresan Tudor smecheru_tudy |
Data | 11 martie 2008 07:25:24 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
var a,b,r,n:int64;
i:longint;
begin
assign(input,'euclid2.in');reset(input);
assign(output,'euclid2.out');rewrite(output);
read(n);
for i:=1 to n do begin
read(a,b);
r:=a mod b;
while r <>0 do begin
a:=b;b:=r;r:=a mod b;
end;
writeln(b); end;
close(input);close(output);
end.
