結果
問題 | No.889 素数! |
ユーザー | McGregorsh |
提出日時 | 2023-04-13 22:38:26 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,890 bytes |
コンパイル時間 | 576 ms |
コンパイル使用メモリ | 82,320 KB |
実行使用メモリ | 90,888 KB |
最終ジャッジ日時 | 2024-10-09 18:37:08 |
合計ジャッジ時間 | 13,169 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 148 ms
89,656 KB |
testcase_01 | RE | - |
testcase_02 | AC | 147 ms
89,472 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 148 ms
89,216 KB |
testcase_06 | AC | 148 ms
89,856 KB |
testcase_07 | AC | 145 ms
89,612 KB |
testcase_08 | AC | 148 ms
89,472 KB |
testcase_09 | RE | - |
testcase_10 | AC | 149 ms
89,236 KB |
testcase_11 | AC | 152 ms
89,088 KB |
testcase_12 | AC | 150 ms
89,600 KB |
testcase_13 | RE | - |
testcase_14 | AC | 149 ms
89,344 KB |
testcase_15 | RE | - |
testcase_16 | AC | 154 ms
89,344 KB |
testcase_17 | RE | - |
testcase_18 | AC | 154 ms
89,300 KB |
testcase_19 | RE | - |
testcase_20 | AC | 148 ms
89,068 KB |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | AC | 151 ms
89,344 KB |
testcase_25 | RE | - |
testcase_26 | AC | 151 ms
89,472 KB |
testcase_27 | RE | - |
testcase_28 | AC | 149 ms
89,472 KB |
testcase_29 | RE | - |
testcase_30 | AC | 152 ms
89,472 KB |
testcase_31 | RE | - |
testcase_32 | AC | 154 ms
89,564 KB |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | AC | 154 ms
89,472 KB |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | AC | 149 ms
89,472 KB |
testcase_42 | RE | - |
testcase_43 | AC | 153 ms
89,600 KB |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | AC | 156 ms
89,728 KB |
testcase_48 | RE | - |
testcase_49 | AC | 149 ms
89,472 KB |
testcase_50 | RE | - |
testcase_51 | RE | - |
testcase_52 | RE | - |
testcase_53 | AC | 149 ms
89,344 KB |
testcase_54 | RE | - |
testcase_55 | RE | - |
testcase_56 | RE | - |
testcase_57 | RE | - |
testcase_58 | RE | - |
testcase_59 | AC | 152 ms
89,472 KB |
testcase_60 | RE | - |
testcase_61 | AC | 150 ms
89,472 KB |
testcase_62 | RE | - |
testcase_63 | RE | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def is_prime(n): if n < 2: return False i = 2 while i * i <= n: if n % i == 0: return False i += 1 return True def main(): N = int(input()) if is_prime(N): print('Sosu!') exit() else: for i in range(10): if i * i == N: print('Heihosu!') exit() if i ** 3 == N: print('Ripposu!') exit() nums = make_divisors(N) if sum(nums[:-1]) == N: print('Kanzensu!') exit() print(N) if __name__ == '__main__': main()