Cod sursa(job #1200693)
Utilizator | Data | 23 iunie 2014 13:21:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
program euclid2;
var
f1,f2:text;
n,m,k,i:integer;
begin
assign (f1,'euclid2.in');
assign (f2,'euclid2.out');
reset(f1);
rewrite (f2);
readln (f1,m);
for i:=1 to m do begin
readln (f1,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 (f2,k) else
writeln (f2,n);
end;
close (f1);
close (f2);
end.