提出 #29444364

---

ソースコード 拡げる

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

void solve() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    int MAX = 100005;
    vector<int> isprime(MAX, true);
    isprime[0] = isprime[1] = false;
    for (int i = 2; i < MAX; i++) {
        if (isprime[i]) {
            for (int j = i+i; j < MAX; j+=i) {
                isprime[j] = false;
            }
        }
    }

    for (int taka = a; taka <= b; taka++) {
        int ok = 1;
        for (int aoki = c; aoki <= d; aoki++) {
            if (isprime[taka+aoki]) ok = 0;
        }
        if (ok) {
            cout << "Takahashi" << endl;
            return;
        }
    }
    cout << "Aoki" << endl;
}

int main() {
    solve();
    return 0;
}

提出情報

ジャッジ結果