#716412 (PyPy3) No.1737 One to N

• 問題: No.1737 One to N
• ユーザー: yassu0320
• 提出日時: 2021-11-14 20:03:51
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 100 ms / 2,000 ms
• コード長: 1,576 bytes
• コンパイル時間: 162 ms
• コンパイル使用メモリ: 82,152 KB
• 実行使用メモリ: 80,268 KB
• 最終ジャッジ日時: 2024-11-30 04:00:56
• 合計ジャッジ時間: 4,562 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 27

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#!/usr/bin/env python3
from pprint import pprint
from sys import setrecursionlimit, stdin
from typing import Dict, Iterable, Set
INF: int = 1 << 62
MOD1000000007 = 10**9 + 7
MOD998244353 = 998244353
setrecursionlimit(1_000_000)
def inputs(type_=int):
    ins = input().split()
    if isinstance(type_, Iterable):
        return [t(x) for t, x in zip(type_, ins)]
    else:
        return list(map(type_, ins))
def input_(type_=int):
    a, = inputs(type_)
    return a
def input1() -> int:
    return int(input())
inputi = input1
def input2():
    a, b = input().split()
    return int(a), int(b)
def input3():
    a, b, c = input().split()
    return int(a), int(b), int(c)
def input4():
    a, b, c, d = input().split()
    return int(a), int(b), int(c), int(d)
def answer(res) -> None:
    print(res)
    exit()
# start coding
def get_one_factor(n: int, start: int = 2) -> int:
    """
    一つの素因数を計算する
    計算量は O(sqrt(n))
    """
    i = start
    while i * i <= n:
        if n % i == 0:
            return i
        i += 1
    return n
def compute_factors(n: int):
    """
    素因数分解を計算する
    計算量は O(sqrt(n)log(n))
    """
    assert n >= 1
    if n == 1:
        return {}
    d = {}
    start = 2
    while n > 1:
        k = get_one_factor(n, start)
        start = k
        count = 0
        while n % k == 0:
            n //= k
            count += 1
        d[k] = count
    return d
n = inputi()
res = 0
for f, cnt in compute_factors(n).items():
    res += f * cnt
print(res)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX