Submission #2243847

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 1e5 + 5;

int solve() {
  int n, k; cin >> n >> k;

  while(n % k != 0 && n >= k) {
    int diff = n - (n / k - 1) * k;
    int jump = n / k + 1;
    int koef = max(1, diff / jump);

    n -= koef * jump;
  }

  if(n < k)
    return 0;
  return n / k;
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);

  int X = 0;

  int n; cin >> n;
  REP(i, n) {
    X ^= solve();
  }

  if(!X) {
    cout << "Aoki\n";
  }
  else {
    cout << "Takahashi\n";
  }
}

Submission Info

Judge Result