Cod sursa(job #181191)
| Utilizator |  giuroiu marius mariuscris90 |
Data | 17 aprilie 2008 22:52:53 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
program euclid;
var t,n,m,i,r:longint;
f,g:text;
begin
assign(f,'euclid2.in');assign(g,'euclid2.out');reset(f);rewrite(g);
readln(f,t);
for i:=1 to t do begin
readln(f,n,m);
r:=n mod m;
n:=m;
m:=r;
while r<>0 do begin
r:=n mod m;
n:=m;
m:=r;end;
writeln(g,n);end;
close(f);close(g);end.