Problem p03422 (C++)

Buggy submission (status: Time Limit Exceeded):
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n)                                                           \
  assert(n < 0x80000000);                                                      \
  for (int i = (a), i##_max = n; i < i##_max; ++i)
#define REM(i, a, n)                                                           \
  assert(n < 0x80000000);                                                      \
  for (int i = int(n) - 1, i##min = a; i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP                                                                \
  {                                                                            \
    cin.tie(NULL);                                                             \
    ios::sync_with_stdio(false);                                               \
  }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
  return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
  return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
  fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
  for (int i = 0; i < M; ++i)
    Fill(dest[i], val);
}
template <class T> T Compare(T left, T right) {
  return left > right ? 1 : (left < right ? -1 : 0);
}
istream &Ignore(istream &ist) {
  string s;
  ist >> s;
  return ist;
}
bool Inside(int i, int j, int h, int w) {
  return i >= 0 && i < h && j >= 0 && j < w;
}
template <class ForwardIterator, class T>
bool All_of(ForwardIterator first, ForwardIterator last, const T &value) {
  for (; first < last; ++first)
    if (*first != value)
      return false;
  return true;
}

#ifdef ONLY_MY_ENVIR
#include "Flow_Solver.h"
#include "Geometry.h"
#include "Global.h"
#include "Graph.h"
#include "IntMod.h"
#include "Matrix.h"
#include "Range.h"
#include "Rational.h"
#include "Segment_Tree.h"
#include "Suffix_Array.h"
#include "Tree.h"
#include "Union_Find.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
  LL tmp;
  ist >> tmp;
  val = tmp;
  return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
  LL tmp = val;
  ost << tmp;
  return ost;
}
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_map>
#include <unordered_set>
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>; // コスト小を優先
template <class T> auto Is(const T &value) {
  return [value](const auto &comparand) -> bool { return comparand == value; };
}
#endif

int N;
int A[200], K[200];

uint func(int a, int k) {
  if (a < k)
    return 0;
  if (a % k == 0)
    return a / k;
  return func(a - (a / k + 1), k);
}

int main() {
  cin >> N;
  REP(i, 0, N) { cin >> A[i] >> K[i]; }
  uint sum = 0;
  REP(i, 0, N) { sum ^= func(A[i], K[i]); }
  cout << (sum == 0 ? "Aoki" : "Takahashi") << endl;
  return 0;
}

Fixed submission:
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n)                                                           \
  assert(n < 0x80000000);                                                      \
  for (int i = (a), i##_max = n; i < i##_max; ++i)
#define REM(i, a, n)                                                           \
  assert(n < 0x80000000);                                                      \
  for (int i = int(n) - 1, i##min = a; i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP                                                                \
  {                                                                            \
    cin.tie(NULL);                                                             \
    ios::sync_with_stdio(false);                                               \
  }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
  return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
  return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
  fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
  for (int i = 0; i < M; ++i)
    Fill(dest[i], val);
}
template <class T> T Compare(T left, T right) {
  return left > right ? 1 : (left < right ? -1 : 0);
}
istream &Ignore(istream &ist) {
  string s;
  ist >> s;
  return ist;
}
bool Inside(int i, int j, int h, int w) {
  return i >= 0 && i < h && j >= 0 && j < w;
}
template <class ForwardIterator, class T>
bool All_of(ForwardIterator first, ForwardIterator last, const T &value) {
  for (; first < last; ++first)
    if (*first != value)
      return false;
  return true;
}

#ifdef ONLY_MY_ENVIR
#include "Flow_Solver.h"
#include "Geometry.h"
#include "Global.h"
#include "Graph.h"
#include "IntMod.h"
#include "Matrix.h"
#include "Range.h"
#include "Rational.h"
#include "Segment_Tree.h"
#include "Suffix_Array.h"
#include "Tree.h"
#include "Union_Find.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
  LL tmp;
  ist >> tmp;
  val = tmp;
  return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
  LL tmp = val;
  ost << tmp;
  return ost;
}
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_map>
#include <unordered_set>
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>; // コスト小を優先
template <class T> auto Is(const T &value) {
  return [value](const auto &comparand) -> bool { return comparand == value; };
}
#endif

int N;
int A[200], K[200];

uint func(int a, int k) {
  if (a < k)
    return 0;
  if (a % k == 0)
    return a / k;
  int rev = a % k;
  int delta = a / k + 1;
  return func(a - ((rev - 1) / delta + 1) * delta, k);
}

int main() {
  cin >> N;
  REP(i, 0, N) { cin >> A[i] >> K[i]; }
  uint sum = 0;
  REP(i, 0, N) { sum ^= func(A[i], K[i]); }
  cout << (sum == 0 ? "Aoki" : "Takahashi") << endl;
  return 0;
}