結果
問題 | No.414 衝動 |
ユーザー | McGregorsh |
提出日時 | 2022-06-22 17:41:03 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,862 bytes |
コンパイル時間 | 153 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 89,216 KB |
最終ジャッジ日時 | 2024-04-23 21:06:01 |
合計ジャッジ時間 | 3,052 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
83,436 KB |
testcase_01 | AC | 119 ms
83,360 KB |
testcase_02 | AC | 124 ms
83,456 KB |
testcase_03 | AC | 135 ms
83,400 KB |
testcase_04 | AC | 138 ms
83,580 KB |
testcase_05 | AC | 136 ms
83,328 KB |
testcase_06 | AC | 136 ms
83,392 KB |
testcase_07 | RE | - |
testcase_08 | AC | 127 ms
83,356 KB |
testcase_09 | AC | 131 ms
83,544 KB |
testcase_10 | AC | 120 ms
83,456 KB |
testcase_11 | AC | 119 ms
83,716 KB |
testcase_12 | AC | 116 ms
83,456 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) if len(nums) == 2: print(1, n) else: print(nums[1], n // nums[1]) if __name__ == '__main__': main()