結果
問題 | No.2130 分配方法の数え上げ mod 998244353 |
ユーザー | McGregorsh |
提出日時 | 2022-11-26 08:58:27 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,830 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 82,440 KB |
実行使用メモリ | 97,060 KB |
最終ジャッジ日時 | 2024-04-10 11:24:18 |
合計ジャッジ時間 | 9,908 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 153 ms
96,296 KB |
testcase_01 | AC | 153 ms
89,188 KB |
testcase_02 | AC | 153 ms
89,496 KB |
testcase_03 | AC | 153 ms
89,624 KB |
testcase_04 | AC | 153 ms
89,440 KB |
testcase_05 | AC | 151 ms
89,500 KB |
testcase_06 | AC | 150 ms
89,624 KB |
testcase_07 | AC | 151 ms
89,576 KB |
testcase_08 | AC | 149 ms
89,652 KB |
testcase_09 | AC | 153 ms
89,320 KB |
testcase_10 | AC | 153 ms
89,564 KB |
testcase_11 | AC | 151 ms
89,276 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
ソースコード
###組合せMOD### def comb(n,k): nCk = 1 MOD = 10**9+7 for i in range(n-k+1, n+1): nCk *= i nCk %= MOD for i in range(1,k+1): nCk *= pow(i,MOD-2,MOD) nCk %= MOD return nCk import sys, re from fractions import Fraction 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP 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 def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): N = int(input()) M = int(input()) total = pow(2, N, MOD2) score = 0 for i in range(M): cost = comb(N, i) score += cost score %= MOD print((total - score) % MOD2) if __name__ == '__main__': main()