Submission #29449120

---

Source Code Expand

import java.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

    static FastScanner sc = new FastScanner();
    static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

    static void solve(){
        HashSet<Integer>prime = new HashSet<>();
        prime.add(1);
        for(int i = 2;i <= 250;i++){
            boolean valid = true;
            for(int j = 2;j < i;j++){
                if(i % j == 0){
                    valid= false;
                }
            }
            if(valid){
                prime.add(i);
            }
        }
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();

        for(int i = a;i <= b;i++){
            boolean p = false;
            for(int j = c;j <= d;j++){
                if(prime.contains(i + j)){
                    p = true;
                    break;
                }
            }
            if(!p){
                System.out.println("Takahashi");
                return;
            }
        }
        System.out.println("Aoki");
    }


    public static void main(String[] args) {
        int n = 1;
        for(int i = 0;i < n;i++){
            solve();
        }
        out.flush();
    }



    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}

Submission Info

Judge Result