Cod sursa(job #1200392)
| Utilizator |  Valentin Valeanu valen.valentin |
Data | 22 iunie 2014 13:48:04 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
program euclid2;
var
fi,fo:text;
n,m,k,i:longint;
begin
assign (fi,'euclid2.in');
assign (fo,'euclid2.out');
reset(fi);
rewrite (fo);
readln (fi,m);
for i:=1 to m do begin
readln (fi,n,k);
while (n<>0) and (k<>0) do
if n>k then n:=n mod k else k:=k mod n;
if n=0 then writeln (fo,k) else
writeln (fo,n);
end;
close (fi);
close (fo);
end.
