結果

問題 No.312 置換処理
ユーザー McGregorsh
提出日時 2022-06-20 16:00:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 131 ms / 2,000 ms
コード長 1,885 bytes
コンパイル時間 129 ms
コンパイル使用メモリ 82,512 KB
実行使用メモリ 83,872 KB
最終ジャッジ日時 2024-10-13 03:43:20
合計ジャッジ時間 6,945 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

###約数列挙###
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()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0