結果
問題 | No.36 素数が嫌い! |
ユーザー | fujisu |
提出日時 | 2015-03-06 08:24:25 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,906 bytes |
コンパイル時間 | 2,441 ms |
コンパイル使用メモリ | 76,048 KB |
実行使用メモリ | 104,688 KB |
最終ジャッジ日時 | 2023-09-06 15:29:54 |
合計ジャッジ時間 | 11,478 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 250 ms
104,076 KB |
testcase_02 | AC | 273 ms
103,872 KB |
testcase_03 | WA | - |
testcase_04 | AC | 270 ms
104,116 KB |
testcase_05 | AC | 268 ms
104,024 KB |
testcase_06 | WA | - |
testcase_07 | AC | 278 ms
104,508 KB |
testcase_08 | AC | 247 ms
104,168 KB |
testcase_09 | AC | 245 ms
104,056 KB |
testcase_10 | AC | 243 ms
104,176 KB |
testcase_11 | AC | 269 ms
104,080 KB |
testcase_12 | AC | 272 ms
104,420 KB |
testcase_13 | AC | 270 ms
104,688 KB |
testcase_14 | AC | 247 ms
104,032 KB |
testcase_15 | AC | 244 ms
104,076 KB |
testcase_16 | AC | 271 ms
103,904 KB |
testcase_17 | AC | 266 ms
104,060 KB |
testcase_18 | AC | 244 ms
103,864 KB |
testcase_19 | AC | 244 ms
104,036 KB |
testcase_20 | AC | 252 ms
104,164 KB |
testcase_21 | AC | 248 ms
104,212 KB |
testcase_22 | AC | 250 ms
103,860 KB |
testcase_23 | AC | 247 ms
103,920 KB |
testcase_24 | AC | 262 ms
103,996 KB |
testcase_25 | WA | - |
testcase_26 | AC | 275 ms
103,924 KB |
testcase_27 | AC | 273 ms
103,968 KB |
testcase_28 | AC | 275 ms
103,972 KB |
testcase_29 | AC | 273 ms
103,924 KB |
ソースコード
import java.io.IOException; import java.util.Arrays; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.List; public class Main { List<Integer> list; boolean check(long k) { int cnt1 = 0; int cnt2 = 0; for (Integer i : list) { if (k % i == 0) { cnt2++; while (k % i == 0) { k /= i; cnt1++; if (2 <= cnt2 || 3 <= cnt1) return true; } } } return false; } void run() { MyScanner sc = new MyScanner(); int max = 10000000 + 9; boolean[] prime = new boolean[max]; Arrays.fill(prime, true); prime[0] = prime[1] = false; for (int i = 0; i * i <= max; i++) { if (prime[i]) { for (int j = i * i; j < max; j += i) { prime[j] = false; } } } list = new LinkedList<Integer>(); for (int i = 0; i < max; i++) { if (prime[i]) { list.add(i); } } long n = sc.nextLong(); System.out.println(check(n) ? "YES" : "NO"); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }