Problem p00211 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll inf = 1LL << 62;

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

int main(void) {
  int n;
  ll runner[10][2];
  ll change[10];
  ll ans[10];
  while (cin >> n, n) {
    rep(i, n) cin >> runner[i][0] >> runner[i][1]; // d // v
    // gcd
    rep(i, n) {
      ll tmp = gcd(runner[i][0], runner[i][1]);
      runner[i][0] /= tmp;
      runner[i][1] /= tmp;
    }
    // lcm
    ll l = runner[0][0];
    rep(i, n - 1) l = lcm(l, runner[i + 1][0]);
    rep(i, n) ans[i] = l / runner[i][0] * runner[i][1];

    // gcd
    ll g = ans[0];
    rep(i, n - 1) g = gcd(g, ans[i + 1]);
    rep(i, n) ans[i] /= g;

    rep(i, n) cout << ans[i] << endl;
  }
  return 0;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll inf = 1LL << 62;

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

int main(void) {
  int n;
  ll runner[10][2];
  ll change[10];
  ll ans[10];
  while (cin >> n, n) {
    rep(i, n) cin >> runner[i][0] >> runner[i][1];
    // gcd
    rep(i, n) {
      ll tmp = gcd(runner[i][0], runner[i][1]);
      runner[i][0] /= tmp;
      runner[i][1] /= tmp;
    }
    // lcm
    ll l = runner[0][1];
    rep(i, n - 1) l = lcm(l, runner[i + 1][1]);
    rep(i, n) change[i] = l / runner[i][1] * runner[i][0];
    // gcd
    ll g = change[0];
    rep(i, n - 1) g = gcd(g, change[i + 1]);
    rep(i, n) change[i] /= g;
    // lcm
    l = change[0];
    rep(i, n - 1) l = lcm(l, change[i + 1]);
    rep(i, n) ans[i] = l / change[i];
    // gcd
    g = ans[0];
    rep(i, n - 1) g = gcd(g, ans[i + 1]);
    rep(i, n) ans[i] /= g;

    rep(i, n) cout << ans[i] << endl;
  }
  return 0;
}