#813878 (PyPy3) No.2119 一般化百五減算

• 問題: No.2119 一般化百五減算
• ユーザー: 👑 rin204
• 提出日時: 2022-11-04 21:30:04
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 3,005 bytes
• コンパイル時間: 138 ms
• コンパイル使用メモリ: 82,176 KB
• 実行使用メモリ: 86,868 KB
• 最終ジャッジ日時: 2024-07-18 19:13:26
• 合計ジャッジ時間: 5,166 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
other	AC * 21 WA * 4

ソースコード

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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
def modinv(a, MOD):
    b = MOD
    u = 1
    v = 0
    while b:
        t = a // b
        a -= t * b
        u -= t * v
        a, b = b, a
        u, v = v, u
    u %= MOD
    return u
def Garner(M, R):
    m_prod = M[0]
    C = R[0]
    for m, r in zip(M[1:], R[1:]):
        t = (r - C) * modinv(m_prod, m) % m
        C += t * m_prod
        m_prod *= m
    
    return C
from math import gcd
def isprime(n):
    if n <= 1:
        return False
    elif n == 2:
        return True
    elif n % 2 == 0:
        return False
    
    A = [2, 325, 9375, 28178, 450775, 9780504, 1795265022]
    s = 0
    d = n - 1
    while d % 2 == 0:
        s += 1
        d >>= 1
    
    for a in A:
        if a % n == 0:
            return True
        x = pow(a, d, n)
        if x != 1:
            for t in range(s):
                if x == n - 1:
                    break
                x = x * x % n
            else:
                return False
    return True
        
def pollard(n):
    if n % 2 == 0:
        return 2
    if isprime(n):
        return n
    
    f = lambda x:(x * x + 1) % n
    
    step = 0
    while 1:
        step += 1
        x = step
        y = f(x)
        while 1:
            p = gcd(y - x + n, n)
            if p == 0 or p == n:
                break
            if p != 1:
                return p
            x = f(x)
            y = f(f(y))
def primefact(n):
    if n == 1:
        return []
    p = pollard(n)
    if p == n:
        return [p]
    left = primefact(p)
    right = primefact(n // p)
    left += right
    return sorted(left)
n = int(input())
m = int(input())
mr = []
for _ in range(m):
    b, c = map(int, input().split())
    mr.append((b, c % b))
mm = {}
rr = {}
ng = False
for m, r in mr:
    if m == 1:
        continue
    
    primes = primefact(m)
    bef = -1
    x = 1
    for p in primes:
        if p != bef:
            if bef != -1:
                if bef in mm:
                    r_ = r % x
                    if mm[bef] >= x:
                        if rr[bef] % x != r_:
                            ng = True
                            break
                    else:
                        if r_ % mm[bef] != rr[bef]:
                            ng = True
                            break
                        mm[bef] = x
                        rr[bef] = r_
                else:
                    mm[bef] = x
                    rr[bef] = r % x
            x = p
            bef = p
        else:
            x *= p
    if bef in mm:
        r_ = r % x
        if mm[bef] >= x:
            if rr[bef] % x != r_:
                ng = True
        else:
            if r_ % mm[bef] != rr[bef]:
                ng = True                    
            mm[bef] = x
            rr[bef] = r_
    else:
        mm[bef] = x
        rr[bef] = r % x
    if ng:
        break
if ng:
    print("NaN")
else:
    M = [1]
    R = [0]
    for k in mm:
        M.append(mm[k])
        R.append(rr[k])
    print(Garner(M, R))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX