結果

問題 No.8054 ほぼ直角二等辺三角形
コンテスト
ユーザー hiromi_ayase
提出日時 2019-04-01 23:27:00
言語 Java
(openjdk 23)
結果
AC  
実行時間 103 ms / 2,000 ms
コード長 4,757 bytes
コンパイル時間 2,812 ms
コンパイル使用メモリ 89,904 KB
実行使用メモリ 40,864 KB
最終ジャッジ日時 2024-11-27 04:42:41
合計ジャッジ時間 6,369 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {

  private static void solve() {
    long[][] x = new long[19][];
    x[1] = new long[]{3L, 4L, 5L};
    x[2] = new long[]{20L, 21L, 29L};
    x[3] = new long[]{119L, 120L, 169L};
    x[4] = new long[]{4059L, 4060L, 5741L};
    x[5] = new long[]{23660L, 23661L, 33461L};
    x[6] = new long[]{137903L, 137904L, 195025L};
    x[7] = new long[]{803760L, 803761L, 1136689L};
    x[8] = new long[]{27304196L, 27304197L, 38613965L};
    x[9] = new long[]{159140519L, 159140520L, 225058681L};
    x[10] = new long[]{927538920L, 927538921L, 1311738121L};
    x[11] = new long[]{31509019100L, 31509019101L, 44560482149L};
    x[12] = new long[]{183648021599L, 183648021600L, 259717522849L};
    x[13] = new long[]{1070379110496L, 1070379110497L, 1513744654945L};
    x[14] = new long[]{36361380737780L, 36361380737781L, 51422757785981L};
    x[15] = new long[]{211929657785303L, 211929657785304L, 299713796309065L};
    x[16] = new long[]{1235216565974040L, 1235216565974041L, 1746860020068409L};
    x[17] = new long[]{7199369738058939L, 7199369738058940L, 10181446324101389L};
    x[18] = new long[]{244566641436218639L, 244566641436218640L, 345869461223138161L};
    
    int X = ni();
    System.out.println(x[X][0] + " " + x[X][1] + " " + x[X][2]);
  }
  private static void solve2() {
    int maxX = 18;
    boolean[] ok = new boolean[maxX + 1];
    outer: for (long m = 2;; m++) {
      long[] s = {sqrtL(2 * m * m - 1), sqrtL(2 * m * m + 1)};

      for (int i = 0; i < 2; i++) {
        if (s[i] > 0) {
          long n = s[i] - m;
          long a = 2 * n * m;
          long b = m * m - n * n;
          long c = m * m + n * n;
          
          if (a > b) {
            long tmp = a;
            a = b;
            b = tmp;
          }
          int x = (int) Math.log10(c) + 1;
          if (!ok[x]) {
            System.out.printf("x[%d] = new long[]{%dL, %dL, %dL};\n", x, a, b, c);
            ok[x] = true;
            if (x == maxX) break outer;
          }
        }
      }
    }

  }

  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