結果

問題 No.1113 二つの整数 / Two Integers
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-07-18 02:33:30
言語 Java19
(openjdk 21)
結果
AC  
実行時間 69 ms / 1,000 ms
コード長 3,122 bytes
コンパイル時間 5,389 ms
コンパイル使用メモリ 83,292 KB
実行使用メモリ 51,376 KB
最終ジャッジ日時 2023-08-20 16:21:06
合計ジャッジ時間 7,561 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
50,848 KB
testcase_01 AC 68 ms
50,740 KB
testcase_02 AC 68 ms
50,880 KB
testcase_03 AC 68 ms
51,000 KB
testcase_04 AC 68 ms
50,924 KB
testcase_05 AC 68 ms
50,876 KB
testcase_06 AC 69 ms
51,104 KB
testcase_07 AC 67 ms
50,760 KB
testcase_08 AC 67 ms
50,960 KB
testcase_09 AC 68 ms
50,936 KB
testcase_10 AC 68 ms
51,184 KB
testcase_11 AC 69 ms
51,052 KB
testcase_12 AC 69 ms
51,376 KB
testcase_13 AC 68 ms
51,108 KB
testcase_14 AC 68 ms
50,924 KB
testcase_15 AC 69 ms
50,940 KB
testcase_16 AC 68 ms
51,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {

  private static void solve() {
    long a = nl();
    long b = nl();

    long g = gcd(a, b);

    long sg = sqrtL(g);
    if (sg < 0) {
      System.out.println("Even");
    } else {
      System.out.println("Odd");
    }
  }

  public static long gcd(long a, long b) {
    while (b > 0) {
      long c = a;
      a = b;
      b = c % b;
    }
    return a;
  }

  public static long sqrtL(long N) {
    long left = (long) (Math.sqrt(N) * 0.99);
    long right = (long) (Math.sqrt(N) * 1.01);

    while (left <= right) {
      long mid = (left + right) / 2;
      long cmp = N - mid * mid;
      if (cmp == 0) {
        return mid;
      } else if (cmp > 0) {
        left = mid + 1;
      } else {
        right = mid - 1;
      }
    }
    return -1;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0