#285771 (Java) No.726 Tree Game

• 問題: No.726 Tree Game
• ユーザー: Grenache
• 提出日時: 2018-09-17 16:50:02
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 131 ms / 2,000 ms
• コード長: 3,233 bytes
• コンパイル時間: 3,956 ms
• コンパイル使用メモリ: 82,516 KB
• 実行使用メモリ: 41,704 KB
• 最終ジャッジ日時: 2024-07-18 07:46:15
• 合計ジャッジ時間: 7,773 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
other	AC * 25

ソースコード

import java.io.*;
import java.util.*;


public class Main_yukicoder726 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		long x = sc.nextInt();
		long y = sc.nextInt();

		boolean xp = Prime.isPrime(x);
		boolean yp = Prime.isPrime(y);
		
		if (xp && yp) {
			pr.println("Second");
		} else if (x == 2 || y == 2) {
			pr.println("Second");
		} else {
			long nx = x + 1;
			while (!Prime.isPrime(nx)) {
				nx++;
			}
			long ny = y + 1;
			while (!Prime.isPrime(ny)) {
				ny++;
			}
			
			if ((nx - x + ny - y) % 2 == 0) {
				pr.println("Second");
			} else {
				pr.println("First");
			}
		}
	}

	static class Prime implements Iterable<Integer> {
		private int n;
		private BitSet p;

		Prime(int n) {
			this.n = n;

			p = new BitSet(n / 2);
			int m = (int)Math.sqrt(n);

//			for (int i = 1; i <= m; i++) {
			for (int bi = p.nextClearBit(0); 2 * (bi + 1) + 1 <= m; bi = p.nextClearBit(bi + 1)) {
				long i = bi + 1;
//				if (p.get(i - 1)) {
//					continue;
//				}

				for (long j = 2 * i * (i + 1); 2 * j + 1 <= n; j += 2 * i + 1) {
					p.set((int)(j - 1));
				}
			}
		}

		boolean isPrime(int n) {
			if (n == 2) {
				return true;
			}

			if (n == 1 || (n & 0x1) == 0) {
				return false;
			}

			return !p.get(n / 2 - 1);
		}

		List<Integer> getPrimeList() {
			List<Integer> ret = new ArrayList<>();
			for (int p : this) {
				ret.add(p);
			}

			return ret;
		}

		Map<Long, Integer> primeFactorize(long x) {
			Map<Long, Integer> hm = new TreeMap<>();
			long n = x;
			for (int p : this) {
				if ((long)p * p > n) {
					break;
				}
				int cnt = 0;
				while (n % p == 0) {
					cnt++;
					n /= p;
				}
				if (cnt > 0) {
					hm.put((long)p, cnt);
				}
			}
			if (n != 1) {
				hm.put(n, 1);
			}

			return hm;
		}

		@Override
		public Iterator<Integer> iterator() {
			return new PrimeIterator();
		}

		private class PrimeIterator implements Iterator<Integer> {
			int index;

			PrimeIterator() {
				index = -1;
			}

			@Override
			public boolean hasNext() {
				if (index == -1) {
					return n >= 2;
				} else {
					return 2 * (index + 1) + 1 <= n;
				}
			}

			@Override
			public Integer next() {
				if (index == -1) {
					if (n >= 2) {
						index = p.nextClearBit(0);
						return 2;
					} else {
						throw new NoSuchElementException();
					}
				} else {
					int ret = 2 * (index + 1) + 1;

					if (ret <= n) {
						index = p.nextClearBit(index + 1);

						return ret;
					} else {
						throw new NoSuchElementException();
					}
				}
			}
		}

		static boolean isPrime(long n) {
			if (n == 2) {
				return true;
			}

			if (n == 1 || (n & 0x1) == 0) {
				return false;
			}

			for (long i = 3; i * i <= n; i += 2) {
				if (n % i == 0) {
					return false;
				}
			}

			return true;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(INPUT == null ? System.in : new ByteArrayInputStream(INPUT.getBytes()));
		pr = new Printer(System.out);

		solve();

//		pr.close();
		pr.flush();
//		sc.close();
	}

	static String INPUT = null;

	private static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}