結果
問題 | No.889 素数! |
ユーザー | uwi |
提出日時 | 2019-09-20 21:23:24 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 46 ms / 2,000 ms |
コード長 | 3,500 bytes |
コンパイル時間 | 6,728 ms |
コンパイル使用メモリ | 77,084 KB |
実行使用メモリ | 51,300 KB |
最終ジャッジ日時 | 2023-10-12 17:38:30 |
合計ジャッジ時間 | 9,610 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,392 KB |
testcase_01 | AC | 45 ms
49,380 KB |
testcase_02 | AC | 44 ms
49,604 KB |
testcase_03 | AC | 44 ms
49,180 KB |
testcase_04 | AC | 44 ms
49,384 KB |
testcase_05 | AC | 43 ms
49,212 KB |
testcase_06 | AC | 42 ms
47,404 KB |
testcase_07 | AC | 43 ms
49,148 KB |
testcase_08 | AC | 43 ms
49,292 KB |
testcase_09 | AC | 43 ms
49,328 KB |
testcase_10 | AC | 43 ms
51,300 KB |
testcase_11 | AC | 44 ms
49,364 KB |
testcase_12 | AC | 44 ms
49,192 KB |
testcase_13 | AC | 45 ms
49,852 KB |
testcase_14 | AC | 45 ms
49,384 KB |
testcase_15 | AC | 44 ms
49,456 KB |
testcase_16 | AC | 44 ms
49,196 KB |
testcase_17 | AC | 44 ms
49,592 KB |
testcase_18 | AC | 45 ms
49,224 KB |
testcase_19 | AC | 45 ms
49,212 KB |
testcase_20 | AC | 45 ms
49,292 KB |
testcase_21 | AC | 44 ms
49,200 KB |
testcase_22 | AC | 44 ms
49,360 KB |
testcase_23 | AC | 44 ms
49,284 KB |
testcase_24 | AC | 44 ms
49,732 KB |
testcase_25 | AC | 44 ms
47,408 KB |
testcase_26 | AC | 44 ms
49,364 KB |
testcase_27 | AC | 44 ms
49,480 KB |
testcase_28 | AC | 44 ms
49,360 KB |
testcase_29 | AC | 46 ms
49,640 KB |
testcase_30 | AC | 44 ms
49,396 KB |
testcase_31 | AC | 44 ms
49,388 KB |
testcase_32 | AC | 44 ms
49,232 KB |
testcase_33 | AC | 44 ms
49,316 KB |
testcase_34 | AC | 44 ms
49,320 KB |
testcase_35 | AC | 44 ms
49,208 KB |
testcase_36 | AC | 45 ms
49,288 KB |
testcase_37 | AC | 44 ms
49,324 KB |
testcase_38 | AC | 44 ms
49,280 KB |
testcase_39 | AC | 43 ms
49,288 KB |
testcase_40 | AC | 44 ms
49,212 KB |
testcase_41 | AC | 43 ms
49,228 KB |
testcase_42 | AC | 44 ms
49,300 KB |
testcase_43 | AC | 43 ms
49,276 KB |
testcase_44 | AC | 43 ms
49,288 KB |
testcase_45 | AC | 44 ms
51,252 KB |
testcase_46 | AC | 43 ms
49,460 KB |
testcase_47 | AC | 45 ms
49,316 KB |
testcase_48 | AC | 44 ms
49,292 KB |
testcase_49 | AC | 44 ms
49,276 KB |
testcase_50 | AC | 44 ms
49,260 KB |
testcase_51 | AC | 44 ms
49,208 KB |
testcase_52 | AC | 43 ms
49,304 KB |
testcase_53 | AC | 43 ms
49,380 KB |
testcase_54 | AC | 43 ms
49,164 KB |
testcase_55 | AC | 43 ms
49,444 KB |
testcase_56 | AC | 43 ms
49,208 KB |
testcase_57 | AC | 43 ms
49,280 KB |
testcase_58 | AC | 44 ms
49,456 KB |
testcase_59 | AC | 43 ms
49,228 KB |
testcase_60 | AC | 44 ms
49,296 KB |
testcase_61 | AC | 44 ms
49,376 KB |
testcase_62 | AC | 43 ms
47,444 KB |
testcase_63 | AC | 43 ms
49,420 KB |
ソースコード
package contest190920; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); if(n == 0 || n == 1) { out.println(n); return; } boolean pr = true; for(int i = 2;i < n;i++) { if(n % i == 0) { pr = false; } } if(pr) { out.println("Sosu!"); return; } int s = (int)Math.sqrt(n); if(s*s == n) { out.println("Heihosu!"); return; } s = (int)Math.cbrt(n); if(s*s*s == n) { out.println("Ripposu!"); return; } if(n == 6 || n == 28) { out.println("Kanzensu!"); return; } out.println(n); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }