Cod sursa(job #316908)
Utilizator | Data | 21 mai 2009 15:54:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
program euclid;
var a,b,n:longint;
begin
assign(input,'euclid2.in');
assign(output,'euclid2.out');
reset(input);
rewrite(output);
readln(input,n);
while n<>0 do begin
readln(input,a,b);
while a<>b do
if a>b then a:=a mod b else b:=b mod a;
writeln(output,a);
n:=n-1;
end;
close(input);
close(output);
end.