結果
問題 | No.36 素数が嫌い! |
ユーザー | fujisu |
提出日時 | 2015-03-06 08:28:58 |
言語 | Java (openjdk 23) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,893 bytes |
コンパイル時間 | 2,109 ms |
コンパイル使用メモリ | 78,824 KB |
実行使用メモリ | 103,188 KB |
最終ジャッジ日時 | 2024-06-24 09:55:07 |
合計ジャッジ時間 | 10,509 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 245 ms
76,876 KB |
testcase_02 | AC | 248 ms
88,300 KB |
testcase_03 | AC | 239 ms
88,224 KB |
testcase_04 | AC | 238 ms
88,268 KB |
testcase_05 | AC | 243 ms
88,088 KB |
testcase_06 | AC | 249 ms
88,024 KB |
testcase_07 | AC | 240 ms
88,544 KB |
testcase_08 | AC | 220 ms
87,984 KB |
testcase_09 | AC | 215 ms
88,256 KB |
testcase_10 | AC | 283 ms
88,264 KB |
testcase_11 | AC | 243 ms
88,620 KB |
testcase_12 | AC | 253 ms
88,680 KB |
testcase_13 | AC | 250 ms
88,380 KB |
testcase_14 | AC | 223 ms
88,612 KB |
testcase_15 | AC | 224 ms
88,272 KB |
testcase_16 | AC | 241 ms
88,416 KB |
testcase_17 | AC | 246 ms
88,532 KB |
testcase_18 | AC | 219 ms
88,352 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 235 ms
88,272 KB |
testcase_25 | WA | - |
testcase_26 | AC | 276 ms
88,284 KB |
testcase_27 | AC | 240 ms
88,272 KB |
testcase_28 | AC | 241 ms
88,248 KB |
testcase_29 | AC | 285 ms
88,572 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 (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();}}}