結果
問題 | No.2896 Monotonic Prime Factors |
ユーザー | mkawa2 |
提出日時 | 2024-09-20 22:09:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 385 ms / 2,000 ms |
コード長 | 2,389 bytes |
コンパイル時間 | 334 ms |
コンパイル使用メモリ | 82,472 KB |
実行使用メモリ | 248,712 KB |
最終ジャッジ日時 | 2024-09-20 22:09:35 |
合計ジャッジ時間 | 7,524 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 215 ms
234,896 KB |
testcase_01 | AC | 188 ms
234,952 KB |
testcase_02 | AC | 192 ms
234,940 KB |
testcase_03 | AC | 213 ms
234,756 KB |
testcase_04 | AC | 316 ms
248,500 KB |
testcase_05 | AC | 356 ms
247,968 KB |
testcase_06 | AC | 344 ms
247,936 KB |
testcase_07 | AC | 322 ms
248,712 KB |
testcase_08 | AC | 341 ms
248,344 KB |
testcase_09 | AC | 355 ms
248,388 KB |
testcase_10 | AC | 330 ms
247,936 KB |
testcase_11 | AC | 254 ms
248,300 KB |
testcase_12 | AC | 274 ms
248,084 KB |
testcase_13 | AC | 333 ms
247,792 KB |
testcase_14 | AC | 347 ms
247,928 KB |
testcase_15 | AC | 253 ms
247,816 KB |
testcase_16 | AC | 270 ms
247,912 KB |
testcase_17 | AC | 284 ms
247,916 KB |
testcase_18 | AC | 385 ms
247,680 KB |
testcase_19 | AC | 255 ms
247,788 KB |
ソースコード
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-(-1 << 31) inf = -1-(-1 << 62) # 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 def nCr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md n_max = 2000005 fac = [1] for i in range(1, n_max+1): fac.append(fac[-1]*i%md) ifac = [1]*(n_max+1) ifac[n_max] = pow(fac[n_max], md-2, md) for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md sv=Sieve(100005) q=II() s=0 for _ in range(q): a,b=LI() _,ee=sv.pf(a) s+=sum(ee) print(nCr(s-1,b-1))