Cod sursa(job #955824)

Utilizator DjokValeriu Motroi Djok Data 1 iunie 2013 16:16:21
Problema Algoritmul lui Euclid Scor 20
Compilator fpc Status done
Runda Arhiva educationala Marime 0.5 kb
var a:array[1..100000,1..3] of longint;
    i, j, n, m:integer;
begin
 assign(input,'euclid2.in');
 assign(output,'euclid2.out');
 reset(input);
 rewrite(output);
 readln(n);
 for i:=1 to n do
  for j:=1 to 2 do
   read(a[i,j]);
    j:=1;
    for i:=1 to n do
    begin
     repeat
      if a[i,j]>a[i,j+1] then a[i,j]:=a[i,j]-a[i,j+1]
                         else a[i,j+1]:=a[i,j+1]-a[i,j];
     until  a[i,j]=a[i,j+1];
      writeln(a[i,j]);
    end;
    close(input);
    close(output);
end.