Something

int extendedGCD(int a, int b, int* m, int* n)
{
   int quot = 1;

   int r[100];
   int s[100];
   int t[100];

   int lauf=1;

   
   t[1] = s[0] = 1;
   t[0] = s[1] = 0;
   r[0] = a;
   r[1] = b;

   cout << "r0, r1, s0, s1, t0, t1: " << r[0] << r[1] << s[0] << s[1] << t[0] << t[1] << endl;

   while(quot != 0)
   {
      quot = r[lauf-1]/r[lauf];

      r[lauf+1] = r[lauf-1] - quot*r[lauf];
//      s[lauf+1] = s[lauf-1] % s[lauf];
//      t[lauf+1] = t[lauf-1] % t[lauf];
      lauf++;
   }

   return r[lauf-1];
}