Mai intai trebuie sa te autentifici.
Cod sursa(job #317550)
| Utilizator |  GRIG T. grigiq |
Data | 23 mai 2009 21:31:16 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
program euclid;
var a,b,n:longint;
begin
assign(input,'euclid2.in');
assign(output,'euclid2.out');
reset(input);
rewrite(output);
readln(input,n);
for n:=n downto 1 do begin
readln(input,a,b);
repeat
if a>b then a:=a mod b
else b:=b mod a;
until (a mod b=0)and(b mod a=0);
if a>=b then writeln(output,b) else writeln(output,a);
end;
end.