結果
問題 | No.1593 Perfect Distance |
ユーザー | hiromi_ayase |
提出日時 | 2021-07-10 01:26:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 2,771 bytes |
コンパイル時間 | 2,555 ms |
コンパイル使用メモリ | 88,820 KB |
実行使用メモリ | 52,492 KB |
最終ジャッジ日時 | 2023-09-14 12:56:07 |
合計ジャッジ時間 | 5,010 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
50,904 KB |
testcase_01 | AC | 71 ms
50,692 KB |
testcase_02 | AC | 70 ms
50,688 KB |
testcase_03 | AC | 70 ms
50,900 KB |
testcase_04 | AC | 69 ms
50,764 KB |
testcase_05 | AC | 70 ms
51,084 KB |
testcase_06 | AC | 69 ms
50,792 KB |
testcase_07 | AC | 69 ms
50,956 KB |
testcase_08 | AC | 71 ms
51,100 KB |
testcase_09 | AC | 80 ms
52,492 KB |
testcase_10 | AC | 80 ms
52,464 KB |
testcase_11 | AC | 83 ms
52,272 KB |
testcase_12 | AC | 80 ms
52,240 KB |
testcase_13 | AC | 80 ms
52,236 KB |
testcase_14 | AC | 80 ms
52,468 KB |
testcase_15 | AC | 84 ms
52,216 KB |
testcase_16 | AC | 85 ms
52,236 KB |
testcase_17 | AC | 71 ms
50,824 KB |
testcase_18 | AC | 70 ms
50,732 KB |
testcase_19 | AC | 70 ms
51,284 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { long n = ni(); n = n * n; long ret = 0; for (long x = 1; x * x < n; x ++) { long y2 = n - x * x; long ys = (long)Math.sqrt(y2); for (long y = ys - 10; y <= ys + 10; y ++) { if (y * y == y2) { ret ++; break; } } } System.out.println(ret); } 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)); } }