Cod sursa(job #1093383)
| Utilizator |  Cristina Cristinutaa |
Data | 27 ianuarie 2014 22:17:02 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
var f,g:text; n,m,k,i:integer;
begin
assign(f, 'euclid2.in');
reset(f);
assign(g, 'euclid2.out');
rewrite(g);
readln(f,k);
for i:=1 to k do
begin
read(f,n); readln(f,m);
while (m mod n<>0) and (n mod m<>0) do
if n>m then n:=n mod m
else m:=m mod n;
if n>m then writeln(g,n)
else writeln(g,m);
end;
close(f); close(g);
end.