D - Prime Sum Game https://atcoder.jp/contests/abc239/tasks/abc239_d

abc239_d.py

def get_prime_list(n):
    prime_list = [True for _ in range(n + 1)]
    prime_list[0] = prime_list[1] = False
    for p in range(2, int(n**0.5) + 1):
        if prime_list[p]:
            i = p * p
            while i <= n:
                prime_list[i] = False
                i += p
    return [i for i, v in enumerate(prime_list) if v]


A, B, C, D = map(int, input().split())
plist = set(get_prime_list(200))

for x in range(A, B + 1):
    f = True
    for y in range(C, D + 1):
        if x + y in plist:
            f = False
            break
    if f:
        print("Takahashi")
        break
else:
    print("Aoki")