Problem p03422 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
// #pragma GCC optimize("no-stack-protector,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugp(x)                                                              \
  cerr << #x << "= {" << (x.first) << ", " << (x.second) << "}" << endl;
#define debug2(x, y)                                                           \
  cerr << "{" << #x << ", " << #y << "} = {" << (x) << ", " << (y) << "}"      \
       << endl;
#define debugv(v)                                                              \
  {                                                                            \
    cerr << #v << " : ";                                                       \
    for (auto x : v)                                                           \
      cerr << x << ' ';                                                        \
    cerr << endl;                                                              \
  }
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout << x << '\n', 0;

const ld eps = 1e-7;
const int inf = 1000000010;
const ll INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG = 20;

int n, m, k, u, v, x, y, t, a, b, ans;
int mark[MAXN];

int G(int x, int k) {
  if (x % k == 0)
    return x / k;
  return G(x - x / k - 1, k);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  cin >> n;
  while (n--) {
    cin >> x >> k;
    ans ^= G(x, k);
  }
  cout << (ans ? "Takahashi\n" : "Aoki\n");

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
// #pragma GCC optimize("no-stack-protector,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugp(x)                                                              \
  cerr << #x << "= {" << (x.first) << ", " << (x.second) << "}" << endl;
#define debug2(x, y)                                                           \
  cerr << "{" << #x << ", " << #y << "} = {" << (x) << ", " << (y) << "}"      \
       << endl;
#define debugv(v)                                                              \
  {                                                                            \
    cerr << #v << " : ";                                                       \
    for (auto x : v)                                                           \
      cerr << x << ' ';                                                        \
    cerr << endl;                                                              \
  }
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout << x << '\n', 0;

const ld eps = 1e-7;
const int inf = 1000000010;
const ll INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG = 20;

int n, m, k, u, v, x, y, t, a, b, ans;
int mark[MAXN];

int G(int x, int k) {
  while (x % k) {
    int tmp = x / k;
    x -= tmp + 1;
    if (x <= tmp * k)
      continue;
    int dwn = 0, up = x / (tmp + 1) + 1;
    while (up - dwn > 1) {
      int mid = (dwn + up) >> 1;
      int xx = x - mid * (tmp + 1);
      if (xx <= tmp * k)
        up = mid;
      else
        dwn = mid;
    }
    x -= dwn * (tmp + 1);
  }
  return x / k;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  cin >> n;
  while (n--) {
    cin >> x >> k;
    ans ^= G(x, k);
  }
  cout << (ans ? "Takahashi\n" : "Aoki\n");

  return 0;
}