結果
問題 | No.312 置換処理 |
ユーザー | McGregorsh |
提出日時 | 2022-06-20 16:00:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 169 ms / 2,000 ms |
コード長 | 1,885 bytes |
コンパイル時間 | 1,049 ms |
コンパイル使用メモリ | 82,140 KB |
実行使用メモリ | 83,968 KB |
最終ジャッジ日時 | 2024-04-21 05:13:30 |
合計ジャッジ時間 | 9,301 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 153 ms
83,328 KB |
testcase_01 | AC | 151 ms
83,680 KB |
testcase_02 | AC | 157 ms
83,456 KB |
testcase_03 | AC | 169 ms
83,328 KB |
testcase_04 | AC | 140 ms
83,072 KB |
testcase_05 | AC | 159 ms
83,700 KB |
testcase_06 | AC | 145 ms
83,584 KB |
testcase_07 | AC | 151 ms
83,840 KB |
testcase_08 | AC | 155 ms
83,584 KB |
testcase_09 | AC | 155 ms
83,552 KB |
testcase_10 | AC | 146 ms
83,712 KB |
testcase_11 | AC | 156 ms
83,584 KB |
testcase_12 | AC | 158 ms
83,456 KB |
testcase_13 | AC | 160 ms
83,356 KB |
testcase_14 | AC | 164 ms
83,836 KB |
testcase_15 | AC | 151 ms
83,692 KB |
testcase_16 | AC | 147 ms
83,456 KB |
testcase_17 | AC | 157 ms
83,200 KB |
testcase_18 | AC | 161 ms
83,664 KB |
testcase_19 | AC | 154 ms
83,584 KB |
testcase_20 | AC | 160 ms
83,456 KB |
testcase_21 | AC | 163 ms
83,352 KB |
testcase_22 | AC | 155 ms
83,456 KB |
testcase_23 | AC | 144 ms
83,328 KB |
testcase_24 | AC | 141 ms
83,584 KB |
testcase_25 | AC | 140 ms
83,328 KB |
testcase_26 | AC | 146 ms
83,536 KB |
testcase_27 | AC | 144 ms
83,444 KB |
testcase_28 | AC | 147 ms
83,560 KB |
testcase_29 | AC | 142 ms
83,200 KB |
testcase_30 | AC | 156 ms
83,968 KB |
testcase_31 | AC | 147 ms
83,368 KB |
testcase_32 | AC | 151 ms
83,712 KB |
testcase_33 | AC | 151 ms
83,456 KB |
testcase_34 | AC | 152 ms
83,252 KB |
testcase_35 | AC | 158 ms
83,288 KB |
testcase_36 | AC | 141 ms
83,328 KB |
testcase_37 | AC | 139 ms
83,384 KB |
testcase_38 | AC | 142 ms
83,200 KB |
testcase_39 | AC | 153 ms
83,516 KB |
testcase_40 | AC | 158 ms
83,596 KB |
testcase_41 | AC | 149 ms
83,584 KB |
testcase_42 | AC | 142 ms
83,456 KB |
testcase_43 | AC | 137 ms
83,456 KB |
testcase_44 | AC | 139 ms
83,584 KB |
ソースコード
###約数列挙### def make_divisors(n): lower_divisors, upper_divisors = [], [] i = 1 while i * i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] ###順列### def nPr(n, r): npr = 1 for i in range(n, n-r, -1): npr *= i return npr ###組合せ### def nCr(n, r): factr = 1 r = min(r, n - r) for i in range(r, 1, -1): factr *= i return nPr(n, r)/factr import sys, re 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 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) nums = make_divisors(n) nums.sort() for i in range(len(nums)): if nums[i] > 2: print(nums[i]) exit() if __name__ == '__main__': main()