結果

問題 No.889 素数!
ユーザー OlandOland
提出日時 2019-09-20 21:44:52
言語 Java21
(openjdk 21)
結果
AC  
実行時間 56 ms / 2,000 ms
コード長 6,712 bytes
コンパイル時間 2,282 ms
コンパイル使用メモリ 78,172 KB
実行使用メモリ 37,384 KB
最終ジャッジ日時 2024-09-14 17:06:30
合計ジャッジ時間 7,116 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,372 KB
testcase_01 AC 50 ms
37,064 KB
testcase_02 AC 52 ms
37,384 KB
testcase_03 AC 52 ms
37,372 KB
testcase_04 AC 53 ms
37,152 KB
testcase_05 AC 52 ms
36,708 KB
testcase_06 AC 51 ms
36,788 KB
testcase_07 AC 52 ms
37,100 KB
testcase_08 AC 52 ms
37,160 KB
testcase_09 AC 51 ms
37,220 KB
testcase_10 AC 52 ms
36,828 KB
testcase_11 AC 53 ms
37,292 KB
testcase_12 AC 53 ms
37,184 KB
testcase_13 AC 51 ms
37,364 KB
testcase_14 AC 51 ms
37,152 KB
testcase_15 AC 51 ms
37,240 KB
testcase_16 AC 52 ms
37,372 KB
testcase_17 AC 51 ms
37,372 KB
testcase_18 AC 50 ms
37,068 KB
testcase_19 AC 51 ms
36,820 KB
testcase_20 AC 50 ms
36,836 KB
testcase_21 AC 51 ms
36,704 KB
testcase_22 AC 53 ms
37,240 KB
testcase_23 AC 51 ms
37,000 KB
testcase_24 AC 51 ms
37,148 KB
testcase_25 AC 50 ms
37,196 KB
testcase_26 AC 50 ms
37,120 KB
testcase_27 AC 51 ms
36,828 KB
testcase_28 AC 52 ms
37,360 KB
testcase_29 AC 52 ms
37,192 KB
testcase_30 AC 51 ms
36,948 KB
testcase_31 AC 51 ms
37,292 KB
testcase_32 AC 51 ms
37,188 KB
testcase_33 AC 50 ms
37,196 KB
testcase_34 AC 51 ms
36,964 KB
testcase_35 AC 51 ms
36,920 KB
testcase_36 AC 50 ms
37,252 KB
testcase_37 AC 51 ms
37,148 KB
testcase_38 AC 52 ms
37,148 KB
testcase_39 AC 51 ms
36,828 KB
testcase_40 AC 51 ms
37,148 KB
testcase_41 AC 51 ms
37,192 KB
testcase_42 AC 51 ms
37,280 KB
testcase_43 AC 56 ms
36,792 KB
testcase_44 AC 51 ms
36,820 KB
testcase_45 AC 51 ms
37,292 KB
testcase_46 AC 50 ms
37,192 KB
testcase_47 AC 52 ms
36,812 KB
testcase_48 AC 50 ms
37,100 KB
testcase_49 AC 49 ms
37,024 KB
testcase_50 AC 50 ms
37,240 KB
testcase_51 AC 50 ms
37,100 KB
testcase_52 AC 50 ms
37,064 KB
testcase_53 AC 50 ms
37,048 KB
testcase_54 AC 51 ms
36,696 KB
testcase_55 AC 51 ms
37,220 KB
testcase_56 AC 51 ms
37,280 KB
testcase_57 AC 51 ms
37,148 KB
testcase_58 AC 53 ms
36,828 KB
testcase_59 AC 53 ms
37,384 KB
testcase_60 AC 50 ms
37,172 KB
testcase_61 AC 51 ms
37,196 KB
testcase_62 AC 50 ms
37,192 KB
testcase_63 AC 50 ms
37,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    private FastScanner in = new FastScanner(System.in);
    private PrintWriter out = new PrintWriter(System.out);
    final int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}

    void solve() throws Exception{
        long sum = 0;
        int n = in.nextInt(), numDiv = 0;
        boolean[] isOk = new boolean[4];
        String[] p = {"Sosu!", "Heihosu!", "Ripposu!", "Kanzensu!"};
        for(int i = 0; i <= n; i++){
            if(i >= 2 && n % i == 0) numDiv++;
            if(i * i == n && n >= 2) isOk[1] = true;
            if(i * i * i == n && n >= 2) isOk[2] = true;
            if(i >= 1 && i != n && n % i == 0) sum += i;
        }
        if(n >= 2 && numDiv == 1) isOk[0] = true;
        if(sum == n && n != 0) isOk[3] = true;

        int idx = -1;
        for(int i = 0; i < isOk.length; i++){
            if(idx != -1 && isOk[i]){
                out.println(n);
                return;
            }
            if(isOk[i]) idx = i;
        }
        if(idx == -1) out.println(n);
        else out.println(p[idx]);
    }
    //end solve

    public static void main(String[] args) throws Exception {
        new Main().m();
    }

    private void m() throws Exception {
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

        int nextInt() {return (int) nextLong();}

        long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }

        public Long[] nextWrapperLongArray(int n) {
            Long[] res = new Long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public Long[] nextWrapperLongArrayDec(int n) {
            Long[] res = new Long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public Long[] nextWrapperLongArray1Index(int n) {
            Long[] res = new Long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
    }
}
0