結果

問題 No.886 Direct
ユーザー mkawa2mkawa2
提出日時 2023-05-02 21:46:10
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 581 ms / 4,000 ms
コード長 2,429 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 82,724 KB
実行使用メモリ 261,124 KB
最終ジャッジ日時 2024-11-21 10:05:10
合計ジャッジ時間 8,228 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
md = 10**9+7
# md = 998244353

class Sieve:
    def __init__(self, n):
        self.plist = [2]
        min_prime_factor = [2, 0]*(n//2+1)
        for x in range(3, n+1, 2):
            if min_prime_factor[x] == 0:
                min_prime_factor[x] = x
                self.plist.append(x)
                if x**2 > n: continue
                for y in range(x**2, n+1, 2*x):
                    if min_prime_factor[y] == 0:
                        min_prime_factor[y] = x
        self.min_prime_factor = min_prime_factor

    def isprime(self, x):
        return self.min_prime_factor[x] == x

    def pf(self, x):
        pp, ee = [], []
        while x > 1:
            mpf = self.min_prime_factor[x]
            if pp and mpf == pp[-1]:
                ee[-1] += 1
            else:
                pp.append(mpf)
                ee.append(1)
            x //= mpf
        return pp, ee

    # unsorted
    def factor(self, a):
        ff = [1]
        pp, ee = self.pf(a)
        for p, e in zip(pp, ee):
            ff, gg = [], ff
            w = p
            for _ in range(e):
                for f in gg: ff.append(f*w)
                w *= p
            ff += gg
        return ff

h, w = LI()

if h == w == 1:
    print(0)
    exit()

if h > w: h, w = w, h

sv = Sieve(w)

aa = [h-i for i in range(h)]
bb = [w-i for i in range(w)]
aa += [0]*(w-h)
aa[0] = bb[0] = 0

for p in sv.plist:
    for i in range((w-1)//p, 0, -1):
        aa[i] += aa[i*p]
        bb[i] += bb[i*p]
        aa[i] %= md
        bb[i] %= md

cc = [a*b%md for a, b in zip(aa, bb)]
for p in sv.plist:
    for i in range((w-1)//p, 0, -1)[::-1]:
        cc[i] -= cc[i*p]
        cc[i] %= md

ans = cc[1]*2+(h-1)*w+h*(w-1)
print(ans%md)
0