problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02768 | mod = 10 ** 9 + 7
def f(n, r):
X = 1
Y = 1
for i in range(r):
X *= n - i # nCr の分子
X %= mod
Y *= i + 1 # nCr の分母
Y %= mod
# フェルマーの小定理より (X/Y)%mod = X*Y^(mod - 2) % mod
return X * pow(Y, mod - 2, mod) % mod
N, A, B = map(int, input().split())
res = pow(2, N,... | mod = 10 ** 9 + 7
def f(n, r):
X = 1
Y = 1
for i in range(r):
X *= n - i # nCr の分子
X %= mod
Y *= i + 1 # nCr の分母
Y %= mod
# フェルマーの小定理より (X/Y)%mod = X*Y^(mod - 2) % mod
return X * pow(Y, mod - 2, mod) % mod
N, A, B = map(int, input().split())
res = pow(2, N,... | [
"expression.operation.binary.add"
] | 564,207 | 564,208 | u339199690 | python |
p02768 | # coding: utf-8
MOD = 10**9+7
# 二分累積法による a^n mod の計算
def modpow(a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % MOD
a = a * a % MOD
n >>= 1
return res
# nCr mod.p (n <= 10**6)
MAX = 1000010
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def COMinit():
fac[0... | # coding: utf-8
MOD = 10**9+7
# 二分累積法による a^n mod の計算
def modpow(a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % MOD
a = a * a % MOD
n >>= 1
return res
# nCr mod.p (n <= 10**6)
MAX = 1000010
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def COMinit():
fac[0... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 564,214 | 564,215 | u707808519 | python |
p02768 | n,a,b = map(int,input().split())
def comb(n,r,mod=10**9+7):
a=1
b=1
r = min(r,n-r)
for i in range(r):
a = a*(n-i)%mod
b = b*(i+1)%mod
return a*pow(b,mod-2,mod)%mod
ans = pow(2,n,10**9+7)-1 - comb(n,a) - comb(n,b)
if ans < 0: ans += 10**9+7
print(ans) | n,a,b = map(int,input().split())
def comb(n,r,mod=10**9+7):
a=1
b=1
r = min(r,n-r)
for i in range(r):
a = a*(n-i)%mod
b = b*(i+1)%mod
return a*pow(b,mod-2,mod)%mod
ans = pow(2,n,10**9+7)-1 - comb(n,a) - comb(n,b)
ans %= 10**9+7
print(ans) | [
"expression.operator.change"
] | 564,254 | 564,255 | u882209234 | python |
p02768 | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | [
"assignment.change"
] | 564,258 | 564,259 | u959340534 | python |
p02768 | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 564,260 | 564,259 | u959340534 | python |
p02768 | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | n, a, b = map(int, input().split())
from operator import mul
from functools import reduce
import math
flg = (a == n-b)
rep = math.ceil(n/2)
MOD = 10**9+7
memo = 0
def modpow(a: int, p: int, mod: int) -> int:
# return a**p (mod MOD) O(log p)
if p == 0:
return 1
if p % 2 == 0:
half = modpow... | [
"assignment.change"
] | 564,261 | 564,259 | u959340534 | python |
p02768 | import math
def modpow(a, n , mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a*a % mod
n >>= 1
return res
def calcp(n,j,mod):
res = 1
for i in range(n,n-j,-1):
res = res * i %mod
return res
def main():
n,a,b = list(map(int, input()... | import math
def modpow(a, n , mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a*a % mod
n >>= 1
return res
def calcp(n,j,mod):
res = 1
for i in range(n,n-j,-1):
res = res * i %mod
return res
def main():
n,a,b = list(map(int, input()... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,284 | 564,285 | u582847048 | python |
p02768 | n,a,b = map(int,input().split())
mod = 10**9 + 7
aue,bue = 1,1
for i in range(a):
aue = aue * (n-i) % mod
for i in range(b):
bue = bue * (n-i) % mod
asita,bsita = 1,1
for i in range(1,a+1):
asita = asita*i %mod
for i in range(1,b+1):
bsita = bsita*i %mod
at = aue * pow(asita,mod-2,mod)
bt = bue * pow(bs... | n,a,b = map(int,input().split())
mod = 10**9 + 7
aue,bue = 1,1
for i in range(a):
aue = aue * (n-i) % mod
for i in range(b):
bue = bue * (n-i) % mod
asita,bsita = 1,1
for i in range(1,a+1):
asita = asita*i %mod
for i in range(1,b+1):
bsita = bsita*i %mod
at = aue * pow(asita,mod-2,mod)
bt = bue * pow(bs... | [
"call.remove"
] | 564,286 | 564,287 | u920204936 | python |
p02768 | mod = int(1e9) + 7
n, a, b = map(int, input().split())
def aaa(base, n):
# base = 2
ans = 1
nn = n
while True:
# print(base, nn)
if nn == 0:
break
if nn % 2 == 0:
base = base ** 2
base = base % mod
nn /= 2
else:
... | mod = int(1e9) + 7
n, a, b = map(int, input().split())
def aaa(base, n):
# base = 2
ans = 1
nn = n
while True:
# print(base, nn)
if nn == 0:
break
if nn % 2 == 0:
base = base ** 2
base = base % mod
nn /= 2
else:
... | [
"assignment.add"
] | 564,300 | 564,301 | u242196904 | python |
p02768 | #156d
n,a,b = map(int, input().split())
##############################################
#https://tane-no-blog.com/976/
mod = pow(10, 9) + 7
def comb(N, x):
#n*(n-1)*…*(n-1+1)を計算
numerator = 1
for i in range(N-x+1, N+1):
numerator = numerator * i % mod
#a!を計算
denominator = 1
for j... | #156d
n,a,b = map(int, input().split())
##############################################
#https://tane-no-blog.com/976/
mod = pow(10, 9) + 7
def comb(N, x):
#n*(n-1)*…*(n-1+1)を計算
numerator = 1
for i in range(N-x+1, N+1):
numerator = numerator * i % mod
#a!を計算
denominator = 1
for j... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 564,314 | 564,315 | u314089899 | python |
p02768 | # https://atcoder.jp/contests/abc156/submissions/10277689
# コンテスト中に通せたけどmodintクラスで実装してみる
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
class ModInt:
def __init__(self, x, MOD=10 ** 9 + 7):
self.mod = MOD
self.x = x if x < MOD else x % MOD
d... | # https://atcoder.jp/contests/abc156/submissions/10277689
# コンテスト中に通せたけどmodintクラスで実装してみる
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
class ModInt:
def __init__(self, x, MOD=10 ** 9 + 7):
self.mod = MOD
self.x = x if 0 <= x < MOD else x % MOD
... | [] | 564,321 | 564,322 | u179169725 | python |
p02768 | import math
MOD = 10 ** 9 + 7
def cmb(n, r):
total = 1
for i in range(r):
total *= (n - i) % MOD
return total * pow(math.factorial(r), MOD - 2, MOD) % MOD
def calc(n, r):
ret = 1
for i in range(r):
ret = ret * (n - i) % MOD
return ret * pow(factorial(r), MOD - 2, MOD) % MOD
... | import math
MOD = 10 ** 9 + 7
def cmb(n, r):
total = 1
for i in range(r):
total *= (n - i) % MOD
return total * pow(math.factorial(r), MOD - 2, MOD) % MOD
def calc(n, r):
ret = 1
for i in range(r):
ret = ret * (n - i) % MOD
return ret * pow(math.factorial(r), MOD - 2, MOD) %... | [] | 564,345 | 564,346 | u644224332 | python |
p02768 | n, a, b = map(int, input().split())
a, b = min(a, n-a), min(b, n-b)
mod = 10**9 +7
def my_pow(num, p, mod):
if p==0:
return 1
elif p%2==0:
return (my_pow(num, p//2, mod)**2)%mod
else:
return (my_pow(num, p-1, mod)*num)%mod
def comb(num, r, mod):
r = min(r, num-r)
y = 1
... | n, a, b = map(int, input().split())
a, b = min(a, n-a), min(b, n-b)
mod = 10**9 +7
def my_pow(num, p, mod):
if p==0:
return 1
elif p%2==0:
return (my_pow(num, p//2, mod)**2)%mod
else:
return (my_pow(num, p-1, mod)*num)%mod
def comb(num, r, mod):
r = min(r, num-r)
y = 1
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,347 | 564,348 | u413165887 | python |
p02768 | import sys
def alg_combination_mod(n, r, mod):
r = min(n - r, r)
if r == 0:
return 1
else:
denominator = 1
for i in range(n, n - r, -1):
denominator = (denominator * i) % mod
molecule = 1
for i in range(1, r + 1):
molecule = (molecule * i) % ... | import sys
def alg_combination_mod(n, r, mod):
r = min(n - r, r)
if r == 0:
return 1
else:
denominator = 1
for i in range(n, n - r, -1):
denominator = (denominator * i) % mod
molecule = 1
for i in range(1, r + 1):
molecule = (molecule * i) % ... | [
"expression.operation.binary.remove",
"call.arguments.change",
"call.arguments.add"
] | 564,373 | 564,374 | u753803401 | python |
p02768 | import sys
def alg_combination_mod(n, r, mod):
r = min(n - r, r)
if r == 0:
return 1
else:
denominator = 1
for i in range(n, n - r, -1):
denominator = (denominator * i) % mod
molecule = 1
for i in range(1, r + 1):
molecule = (molecule * i) % ... | import sys
def alg_combination_mod(n, r, mod):
r = min(n - r, r)
if r == 0:
return 1
else:
denominator = 1
for i in range(n, n - r, -1):
denominator = (denominator * i) % mod
molecule = 1
for i in range(1, r + 1):
molecule = (molecule * i) % ... | [
"call.arguments.change",
"call.arguments.add"
] | 564,373 | 564,376 | u753803401 | python |
p02768 | import sys, math
def input():
return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_left # bisect_left(list, value)
#from fractions import gcd
enu = enumerate
sys.setrecursionlimit(10**7)
n... | import sys, math
def input():
return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_left # bisect_left(list, value)
#from fractions import gcd
enu = enumerate
sys.setrecursionlimit(10**7)
n... | [
"assignment.change"
] | 564,380 | 564,381 | u625729943 | python |
p02768 | n,a,b=map(int,input().split())
def combination(n, a, mod):
bunshi = 1
bunbo = 1
for i in range(a):
bunshi *= n-i
bunshi = bunshi%mod
bunbo *= a-i
bunbo = bunbo%mod
return bunshi*pow(bunbo, mod-2, mod)%mod
mod = 100000007
answer = pow(2, n, mod)
answer -= 1
answer -= comb... | n,a,b=map(int,input().split())
def combination(n, a, mod):
bunbo = 1
bunshi = 1
for i in range(a):
bunshi *= n-i
bunshi = bunshi%mod
bunbo *= a-i
bunbo = bunbo%mod
return bunshi*pow(bunbo, mod-2, mod)%mod
mod = 1000000007
answer = pow(2, n, mod)... | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change"
] | 564,382 | 564,383 | u257018224 | python |
p02768 | n,a,b=map(int,input().split())
def combination(n, a, mod):
bunshi = 1
bunbo = 1
for i in range(a):
bunshi *= n-i
bunshi = bunshi%mod
bunbo *= a-i
bunbo = bunbo%mod
return bunshi*pow(bunbo, mod-2, mod)%mod
mod = 100000007
answer = pow(2, n, mod)
answer -= 1
answer -= comb... | n, a, b = map(int, input().split())
def combination(n, a, mod):
bunbo = 1
bunshi = 1
for i in range(a):
bunshi *= n-i
bunshi = bunshi%mod
bunbo *= a-i
bunbo = bunbo%mod
return bunshi*pow(bunbo, mod-2, mod)%mod
mod = 1000000007
answer = pow(2,... | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change"
] | 564,382 | 564,384 | u257018224 | python |
p02768 | from functools import reduce
def perm(n, k, p):
ret = 1
for i in range(n, n-k-1, -1):
ret = (ret * i)%p
return ret
def comb(n, k, p):
"""power_funcを用いて(nCk) mod p を求める"""
a = perm(n, k, p)
b = perm(k, k, p)
return (a*pow(b, p-2, p))%p
n, a, b = map(int, input().split())
MOD = 10**9 + 7
print... | from functools import reduce
def perm(n, k, p):
ret = 1
for i in range(n, n-k, -1):
ret = (ret * i)%p
return ret
def comb(n, k, p):
"""power_funcを用いて(nCk) mod p を求める"""
a = perm(n, k, p)
b = perm(k, k, p)
return (a*pow(b, p-2, p))%p
n, a, b = map(int, input().split())
MOD = 10**9 + 7
print((... | [
"expression.operation.binary.remove"
] | 564,389 | 564,390 | u667084803 | python |
p02768 | def factorial_mod(a, M):
ans = 1
for i in range(a,1,-1):
ans = (ans * i) % M
return ans
def test(n, a, M):
ans = 1
for i in range(a):
ans = (ans * (n-i)) % M
return ans
def combination_mod(n,a,M):
tmp = factorial_mod(a,M)
tmp = pow(tmp, M-2, M)
ans = test(n,a,M) * tmp... | def factorial_mod(a, M):
# return a!(mod M)
ans = 1
for i in range(a,1,-1):
ans = (ans * i) % M
return ans
def test(n, a, M):
# return (nCaの分子) % M
ans = 1
for i in range(a):
ans = (ans * (n-i)) % M
return ans
def combination_mod(n,a,M):
# return nCa % M
tmp = fac... | [
"call.arguments.add",
"call.arguments.change"
] | 564,393 | 564,394 | u549278479 | python |
p02768 | import math
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def combination(n, r, mod=... | import math
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def combination(n, r, mod=... | [
"expression.operation.binary.add"
] | 564,415 | 564,416 | u466331465 | python |
p02768 | MOD = 10**9+7
def pow(a, b):
res = 1
while b:
if b & 1: res = res * a % MOD
a = a**2 % MOD
b >>= 1
return res
n, a, b = list(map(int, input().split()))
ans = pow(2, n)-1
for X in [a, b]:
x = 1
y = 1
for i in range(X):
x = x * (n-i) % MOD
y = y * (i+1) %... | MOD = 10**9+7
def pow(a, b):
res = 1
while b:
if b & 1: res = res * a % MOD
a = a**2 % MOD
b >>= 1
return res
n, a, b = list(map(int, input().split()))
ans = pow(2, n)-1
for X in [a, b]:
x = 1
y = 1
for i in range(X):
x = x * (n-i) % MOD
y = y * (i+1) %... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,423 | 564,424 | u721316601 | python |
p02768 | import sys
from collections import deque, Counter, defaultdict
from math import gcd
input = lambda: sys.stdin.readline().rstrip()
def eprint(s):
sys.stderr.write('DEBUG: {}'.format(s))
return
def comb(n,r,mod):
p,q=1,1
for i in range(r):
p=p*(n-i)%mod
q=q*(i+1)%mod
return p*pow(q... | import sys
from collections import deque, Counter, defaultdict
from math import gcd
input = lambda: sys.stdin.readline().rstrip()
def eprint(s):
sys.stderr.write('DEBUG: {}'.format(s))
return
def comb(n,r,mod):
p,q=1,1
for i in range(r):
p=p*(n-i)%mod
q=q*(i+1)%mod
return p*pow(q... | [
"call.arguments.change"
] | 564,438 | 564,439 | u593934357 | python |
p02768 | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | [
"expression.operation.binary.remove",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,456 | 564,457 | u686713618 | python |
p02768 | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,458 | 564,457 | u686713618 | python |
p02768 | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = []
mod = 10**9+7
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivo... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,459 | 564,457 | u686713618 | python |
p02768 | n, a, b = map(int, input().split())
m = 10**9+7
def cmb(r):
N = 1
R = 1
for i in range(r):
N = N*(n - i) % m
R = R*(i+1) % m
return N*pow(R, m-2, m)%m
ans = pow(2, n, m) - ((cmb(a) + cmb(b) + 1)%m)
print(ans) | n, a, b = map(int, input().split())
m = 10**9+7
def cmb(r):
N = 1
R = 1
for i in range(r):
N = N*(n - i) % m
R = R*(i+1) % m
return N*pow(R, m-2, m)%m
ans = (pow(2, n, m) - ((cmb(a) + cmb(b) + 1)%m))%m
print(ans) | [
"assignment.change"
] | 564,460 | 564,461 | u700805562 | python |
p02768 | def pow2(n, mod):
p = 2
r = 1
while n:
if n % 2:
r = r * p % mod
p = (p * p) % mod
n //= 2
return r
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
def nCr(n, r, mod):
t = 1
r = min(r, n - r)
for i in range(n - r + 1, n + 1):
t = t * i % mod
return ... | def pow2(n, mod):
p = 2
r = 1
while n:
if n % 2:
r = r * p % mod
p = (p * p) % mod
n //= 2
return r
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
def nCr(n, r, mod):
t = 1
r = min(r, n - r)
for i in range(n - r + 1, n + 1):
t = t * i % mod
return ... | [
"assignment.variable.change",
"identifier.change"
] | 564,492 | 564,493 | u858742833 | python |
p02768 | n,a,b=map(int,input().split())
def combination(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = (numer*(n1-i)) % mod
denom = (denom*i) % mod
return numer * pow(denom, mod-2, mod) % mod
mod=10**9+7
print((pow(2,n,mod) - combination(n,a,mo... | n,a,b=map(int,input().split())
def combination(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = (numer*(n1-i)) % mod
denom = (denom*i) % mod
return numer * pow(denom, mod-2, mod) % mod
mod=10**9+7
print((pow(2,n,mod)- 1 - combination(n,a... | [
"expression.operation.binary.add"
] | 564,504 | 564,505 | u951480280 | python |
p02768 | from scipy.special import comb
n,a,b=map(int,input().split())
MOD=10**9+7
def pos(x, n, m):
if n == 0:
return 1
res = pos(x*x%m, n//2, m)
if n%2 == 1:
res = res*x%m
return res
def comb(n,k):
if n<k:
return 0
if n<0 or k<0:
return 0
k=min(n-k,k)
ans=1
... |
n,a,b=map(int,input().split())
MOD=10**9+7
def pos(x, n, m):
if n == 0:
return 1
res = pos(x*x%m, n//2, m)
if n%2 == 1:
res = res*x%m
return res
def comb(n,k):
if n<k:
return 0
if n<0 or k<0:
return 0
k=min(n-k,k)
ans=1
inv=[1]*(k+1)
if k>=1:
... | [] | 564,510 | 564,511 | u511379665 | python |
p02768 | def binary(n):
return bin(n)[2:]
# バイナリ法
def pow_by_binary_exponentiation(a, x, n): # a^x mod n
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
# mを法とするaの乗法的逆元
def modinv(a, m):
g, x, y = egcd... | def binary(n):
return bin(n)[2:]
# バイナリ法
def pow_by_binary_exponentiation(a, x, n): # a^x mod n
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
# mを法とするaの乗法的逆元
def modinv(a, m):
g, x, y = egcd... | [
"assignment.change",
"expression.operation.binary.add"
] | 564,529 | 564,530 | u815878613 | python |
p02768 | n,a,b=map(int,input().split())
m=10**9+7
def com(n,k,m):
p,q=1,1
for i in range(n-k+1,n+1):
p*=i
p%=m
for i in range(1,k+1):
q*=i
q%=m
return p*pow(q,m-2,m)%m
ca,cb=com(n,a,m),com(n,b,m)
ans=(pow(2,n,m)-1-ca-cb)%m | n,a,b=map(int,input().split())
m=10**9+7
def com(n,k,m):
p,q=1,1
for i in range(n-k+1,n+1):
p*=i
p%=m
for i in range(1,k+1):
q*=i
q%=m
return p*pow(q,m-2,m)%m
ca,cb=com(n,a,m),com(n,b,m)
ans=(pow(2,n,m)-1-ca-cb)%m
print(ans) | [
"call.add"
] | 564,552 | 564,553 | u393512980 | python |
p02768 | n,a,b=map(int,input().split())
m=10**9+7
def com(n,k,m):
p,q=1,1
for i in range(n-k+1,n+1):
p*=i
p%=m
for i in range(1,k+1):
q*=i
q%=m
return p*pow(q,m-2,m)%m
ca,cb=com(n,a,m),com(n,b,m)
ans=(pow(2,n,m)-ca-cb)%m | n,a,b=map(int,input().split())
m=10**9+7
def com(n,k,m):
p,q=1,1
for i in range(n-k+1,n+1):
p*=i
p%=m
for i in range(1,k+1):
q*=i
q%=m
return p*pow(q,m-2,m)%m
ca,cb=com(n,a,m),com(n,b,m)
ans=(pow(2,n,m)-1-ca-cb)%m
print(ans) | [
"call.add"
] | 564,555 | 564,553 | u393512980 | python |
p02768 | n, a, b = map(int, input().split())
mod = 10**9 + 7
a = min(a, n-a)
b = min(b, n-b)
com = [1] * (max(a, b) + 1)
for i in range(1,len(com)):
com[i] = (com[i-1] * pow(i, mod-2, mod) * (n-i+1)) % mod
print(pow(2, n, mod) - 1 - com[a] - com[b]) | #!/usr/bin/env python3
n, a, b = map(int, input().split())
mod = 10**9 + 7
a = min(a, n-a)
b = min(b, n-b)
com = [1] * (max(a, b) + 1)
for i in range(1,len(com)):
com[i] = (com[i-1] * pow(i, mod-2, mod) * (n-i+1)) % mod
print((pow(2, n, mod) + mod - 1 - com[a] - com[b]) % mod) | [
"call.arguments.change",
"call.arguments.add"
] | 564,571 | 564,572 | u552357043 | python |
p02768 | n, a, b = map(int, input().split())
mod = 10**9 + 7
a = min(a, n-a)
b = min(b, n-b)
com = [1] * (max(a, b) + 1)
for i in range(1,len(com)):
com[i] = (com[i-1] * pow(i, mod-2, mod) * (n-i+1)) % mod
print(pow(2, n, mod) - 1 - com[a] - com[b]) | n, a, b = map(int, input().split())
mod = 10**9 + 7
a = min(a, n-a)
b = min(b, n-b)
com = [1] * (max(a, b) + 1)
for i in range(1,len(com)):
com[i] = (com[i-1] * pow(i, mod-2, mod) * (n-i+1)) % mod
print((pow(2, n, mod) - 1 - com[a] - com[b] + mod) % mod) | [
"call.arguments.change",
"call.arguments.add"
] | 564,571 | 564,574 | u552357043 | python |
p02768 | n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
import time
start = time.time()
# xの逆元を求める。フェルマーの小定理より、 x の逆元は x ^ (mod - 2) に等しい。計算時間はO(log(mod))程度。
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
def modinv(x):
return pow(x, mod-2, mod)
modinv_table = [-1] * (b+1)
for i in range(1, b+1):
mo... | n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
import time
start = time.time()
# xの逆元を求める。フェルマーの小定理より、 x の逆元は x ^ (mod - 2) に等しい。計算時間はO(log(mod))程度。
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
def modinv(x):
return pow(x, mod-2, mod)
modinv_table = [-1] * (b+1)
for i in range(1, b+1):
mo... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 564,579 | 564,580 | u162612857 | python |
p02768 | def loop_pow(x,n,mod):
if n==0:
return 1
if n%2==0:
t=loop_pow(x,n//2,mod)
return (t*t)%mod
return x*loop_pow(x,n-1,mod)%mod
def com(N,K,mod):
n=N
k=K
up=1
down=1
for _ in range(K):
up*=n
up%=mod
n-=1
for _ in range(K):
down*=k... | def loop_pow(x,n,mod):
if n==0:
return 1
if n%2==0:
t=loop_pow(x,n//2,mod)
return (t*t)%mod
return x*loop_pow(x,n-1,mod)%mod
def com(N,K,mod):
n=N
k=K
up=1
down=1
for _ in range(K):
up*=n
up%=mod
n-=1
for _ in range(K):
down*=k... | [
"assignment.change"
] | 564,585 | 564,586 | u079022693 | python |
p02768 | n, a, b = map(int, input().split())
law = 10 ** 9 + 7
def fermat(n, r, law):
x = 1
y = 1
for i in range(r):
x = x * (n - i) % law
y = y * (i + 1) % law
ans = x * pow(y, law - 2, law)
return ans
print((pow(2,n,law)- fermat(n,a,law)-fermat(n,b,law))%law) | n, a, b = map(int, input().split())
law = 10 ** 9 + 7
def fermat(n, r, law):
x = 1
y = 1
for i in range(r):
x = x * (n - i) % law
y = y * (i + 1) % law
ans = x * pow(y, law - 2, law) % law
return ans
print((pow(2,n,law)- fermat(n,a,law)-fermat(n,b,law)-1)%law) | [
"assignment.change",
"expression.operation.binary.add"
] | 564,623 | 564,624 | u809816772 | python |
p02768 | n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def choose(n, a):
x = 1
y = 1
for i in range(1, a + 1):
x = (x * (n - i + 1)) % mod
y = (y * i) % mod
return (x * pow(y, mod - 2, mod)) % mod
print(pow(2, n, mod) - 1 - ((choose(n, a) + choose(n, b)) % mod))
| n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def choose(n, a):
x = 1
y = 1
for i in range(1, a + 1):
x = (x * (n - i + 1)) % mod
y = (y * i) % mod
return (x * pow(y, mod - 2, mod)) % mod
print((pow(2, n, mod) - 1 - choose(n, a) - choose(n, b)) % mod )
| [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 564,634 | 564,635 | u639340617 | python |
p02768 | #d
n,a,b = map(int,input().split())
def power(x, n, mod):
"""
x**n mod in O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = K * x % mod
x = x ** 2 % mod
n = (n - 1) // 2
else:
x = x ** 2 % mod
... | #d
n,a,b = map(int,input().split())
def power(x, n, mod):
"""
x**n mod in O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = K * x % mod
x = x ** 2 % mod
n = (n - 1) // 2
else:
x = x ** 2 % mod
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 564,651 | 564,652 | u586759271 | python |
p02768 | n, a, b = map(int, input().split())
MOD = 1000000007
def combination(n, r):
r = min(r, n - r)
num = 1
den = 1
for i in range(1, r + 1):
num = (num * (n + 1 - i)) % MOD
den = (den * i) % MOD
return num * pow(den, MOD - 2, MOD) % MOD
def func(a, n, p):
bi = str(format(n, "b"... | n, a, b = map(int, input().split())
MOD = 1000000007
def combination(n, r):
r = min(r, n - r)
num = 1
den = 1
for i in range(1, r + 1):
num = (num * (n + 1 - i)) % MOD
den = (den * i) % MOD
return num * pow(den, MOD - 2, MOD) % MOD
def func(a, n, p):
bi = str(format(n, "b... | [
"assignment.change"
] | 564,728 | 564,729 | u137542041 | python |
p02768 | import math
z = 10**9 + 7
n, a, b = [int(i) for i in input().split()]
r = pow(2, n, z)
def c(m):
x = 1
for i in range(n-m+1, n+1):
x = x*i % z
return (x * pow(math.factorial(m), z-2, z)) % z
r = (r - c(a) - c(b)) % z
print(r) | import math
z = 10**9 + 7
n, a, b = [int(i) for i in input().split()]
r = pow(2, n, z) - 1
def c(m):
x = 1
for i in range(n-m+1, n+1):
x = x*i % z
return (x * pow(math.factorial(m), z-2, z)) % z
r = (r - c(a) - c(b)) % z
print(r) | [
"assignment.change"
] | 564,752 | 564,753 | u871509659 | python |
p02768 | n, a, b = [int(i) for i in input().split()]
mod = 10**9+7
def func_156d(n, r):
r =min(r, n-r)
numerator = 1
denominator = 1
for i in range(n-r+1, n+1):
numerator = numerator * i % mod
for i in range(1, r+1):
denominator = denominator * i % mod
return numer... | n, a, b = [int(i) for i in input().split()]
mod = 10**9+7
def func_156d(n, r):
r =min(r, n-r)
numerator = 1
denominator = 1
for i in range(n-r+1, n+1):
numerator = numerator * i % mod
for i in range(1, r+1):
denominator = denominator * i % mod
return numer... | [
"call.arguments.change"
] | 564,773 | 564,774 | u840310460 | python |
p02768 | n,a,b = map(int,input().split())
mod = 10**9+7
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
sum = pow(2,n,mod)
case = combination(n,a,mod) + com... | n,a,b = map(int,input().split())
mod = 10**9+7
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
sum = pow(2,n,mod)
case = combination(n,a,mod) + com... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,802 | 564,803 | u397384480 | python |
p02768 | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | [
"call.arguments.change",
"call.arguments.add"
] | 564,807 | 564,808 | u386819480 | python |
p02768 | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | [
"call.arguments.change"
] | 564,809 | 564,808 | u386819480 | python |
p02768 | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | [
"call.arguments.change"
] | 564,810 | 564,811 | u386819480 | python |
p02768 | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | #!/usr/bin/env python3
import sys
# sys.setrecursionlimit(10000000)
INF = 1<<32
# import numpy as np
MOD = 1000000007 # type: int
def solve(n: int, a: int, b: int):
def combination_with_mod(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
... | [
"call.arguments.change"
] | 564,812 | 564,811 | u386819480 | python |
p02768 | n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
def choose(n, r, mod):
r = min(r, n - r)
x = 1
y = 1
for i in range(r):
x = x * (n - i) % mod
y = y * (i + 1) % mod
y = pow(y, -2, mod)
return x * y % mod
ans = pow(2, n, mod) - 1 - choose(n, a, mod) - choose(n, b, mod)
w... | n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
def choose(n, r, mod):
r = min(r, n - r)
x = 1
y = 1
for i in range(r):
x = x * (n - i) % mod
y = y * (i + 1) % mod
y = pow(y, mod-2, mod)
return x * y % mod
ans = pow(2, n, mod) - 1 - choose(n, a, mod) - choose(n, b, mod)... | [
"call.arguments.change"
] | 564,819 | 564,820 | u118211443 | python |
p02768 | #コンビネーション。
def comb(n,m,p=10**9+7):
if n < m : return 0
if n < 0 or m < 0:return 0
m = min(m, n-m)
top = bot = 1
for i in range(m):
top = top*(n-i) % p
bot = bot*(i+1) % p
bot = pow(bot, p-2, p)
return top*bot % p
#累乗
def mpow(x: int, k: int, MOD=1000000007) -> int:
res ... | #コンビネーション。
def comb(n,m,p=10**9+7):
if n < m : return 0
if n < 0 or m < 0:return 0
m = min(m, n-m)
top = bot = 1
for i in range(m):
top = top*(n-i) % p
bot = bot*(i+1) % p
bot = pow(bot, p-2, p)
return top*bot % p
#累乗
def mpow(x: int, k: int, MOD=1000000007) -> int:
res ... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 564,885 | 564,886 | u208713671 | python |
p02768 |
n,a,b=map(int,input().split())
mod=10**9+7
P = 10**9 + 7
N = 200001
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
def power_func(a,n,p):
bi=str(format(n,"b"))#2進表現に
res=1
for i in range(len(bi)):
res=(res*res) %p
if bi[i]=="1":
res=(res*a) %p
return res
... |
n,a,b=map(int,input().split())
mod=10**9+7
P = 10**9 + 7
N = 200001
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
def power_func(a,n,p):
bi=str(format(n,"b"))#2進表現に
res=1
for i in range(len(bi)):
res=(res*res) %p
if bi[i]=="1":
res=(res*a) %p
return res
... | [
"assignment.change"
] | 564,905 | 564,906 | u459798349 | python |
p02768 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.s... | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.s... | [] | 564,916 | 564,917 | u333945892 | python |
p02769 | mod_val = 10**9+7
n, k = map(int, input().split())
factorials = [1]*(n+1) # values 0 to n
for i in range(2, n+1):
factorials[i] = (factorials[i-1]*i)%mod_val
def mod_binomial(a, b):
numerator = factorials[a]
denominator = (factorials[b]*factorials[a-b])%mod_val
invert = pow(denominator, mod_val-2, mod_val)
r... | mod_val = 10**9+7
n, k = map(int, input().split())
factorials = [1]*(n+1) # values 0 to n
for i in range(2, n+1):
factorials[i] = (factorials[i-1]*i)%mod_val
def mod_binomial(a, b):
numerator = factorials[a]
denominator = (factorials[b]*factorials[a-b])%mod_val
invert = pow(denominator, mod_val-2, mod_val)
r... | [
"expression.operation.binary.remove"
] | 564,945 | 564,946 | u460375306 | python |
p02769 | n,k = map(int,input().split())
mod = 10**9 + 7
fact = [1]
finv = [1]
for i in range(1, 2*n):
fact.append((fact[i-1] * i) % mod)
finv.append(pow(fact[i], mod-2, mod))
if n-1 <= k:
print((fact[2*n-1] * finv[n] * finv[n-1]) % mod)
ans = 0
for i in range(k+1):
ans += fact[n] * finv[n-i] * finv[i] * fact[... | n,k = map(int,input().split())
mod = 10**9 + 7
fact = [1]
finv = [1]
for i in range(1, 2*n):
fact.append((fact[i-1] * i) % mod)
finv.append(pow(fact[i], mod-2, mod))
if n-1 <= k:
print((fact[2*n-1] * finv[n] * finv[n-1]) % mod)
exit()
ans = 0
for i in range(k+1):
ans += fact[n] * finv[n-i] * finv... | [
"call.add"
] | 564,951 | 564,952 | u934868410 | python |
p02769 | N, K = list(map(int, input().split()))
p = 10**9+7
size = 2*2*10**5
def binom(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, size + 1):
fact.append((fact[-1] * i) % p)
... | N, K = list(map(int, input().split()))
p = 10**9+7
size = 2*2*10**5
def binom(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, size + 1):
fact.append((fact[-1] * i) % p)
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 564,953 | 564,954 | u892305365 | python |
p02769 | n, k = map(int, input().split())
c1 = 1
c2 = 1
mod = 10**9+7
ans = 0
for i in range(min(n, k+1)):
ans += c1 * c2
c1 *= (n-i) * pow(i+1, mod-2, mod)
c1 %= mod
c2 *= (n-i-1) * pow(i+1, mod-2, mod)
c2 %= mod
print(ans) | n, k = map(int, input().split())
c1 = 1
c2 = 1
mod = 10**9+7
ans = 0
for i in range(min(n, k+1)):
ans += c1 * c2
c1 *= (n-i) * pow(i+1, mod-2, mod)
c1 %= mod
c2 *= (n-i-1) * pow(i+1, mod-2, mod)
c2 %= mod
print(ans%mod) | [
"expression.operation.binary.add"
] | 564,979 | 564,980 | u875541136 | python |
p02769 | mod=10**9+7
comb1=1
comb2=1
N,K=map(int,input().split())
k=min(K,N-1)
x=0
for i in range(k):
comb1=(comb1*(N-i)*pow(i+1,mod-2,mod))%(mod)
comb2=(comb2*(N-1-i)*pow(i+1,mod-2,mod))%(mod)
x+=(comb1*comb2)%(mod)
print(x%(mod))
| mod=10**9+7
comb1=1
comb2=1
N,K=map(int,input().split())
k=min(K,N-1)
x=0
for i in range(k):
comb1=(comb1*(N-i)*pow(i+1,mod-2,mod))%(mod)
comb2=(comb2*(N-1-i)*pow(i+1,mod-2,mod))%(mod)
x+=(comb1*comb2)%(mod)
print((x+1)%(mod))
| [
"call.arguments.change"
] | 564,981 | 564,982 | u387774811 | python |
p02769 | n,k=map(int,input().split())
mod=10**9+7
U = 4*10**5+1
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U],MOD-2,MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n,k):
if k < 0 or k > n:
return 0
x = fac... | n,k=map(int,input().split())
mod=10**9+7
U = 4*10**5+1
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U],MOD-2,MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n,k):
if k < 0 or k > n:
return 0
x = fac... | [
"call.arguments.change"
] | 564,989 | 564,990 | u350248178 | python |
p02769 | from sys import stdin
def prepare(n, p):
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((fact... | from sys import stdin
def prepare(n, p):
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((fact... | [
"control_flow.branch.if.add"
] | 564,999 | 565,000 | u659302753 | python |
p02769 | n, k = map(int, input().split())
mod = 10**9+7
k = min([k, n-1])
ans = 0
key = 1
for i in range(k):
ans += key
ans %= mod
key = (((key*(n-i)%mod)*(n-i-1)%mod)*pow(pow(i+1, mod-2, mod), 2, mod))%mod
print(ans) | n, k = map(int, input().split())
mod = 10**9+7
k = min([k, n-1])
ans = 0
key = 1
for i in range(k+1):
ans += key
ans %= mod
key = (((key*(n-i)%mod)*(n-i-1)%mod)*pow(pow(i+1, mod-2, mod), 2, mod))%mod
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 565,001 | 565,002 | u021548497 | python |
p02769 | class Combinatorics:
def __init__(self, N, mod):
'''
Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)
over the finite field Z/(mod)Z.
Input:
N (int): maximum n
mod (int): a prime number. The order of the field Z/(mod)Z over which... | class Combinatorics:
def __init__(self, N, mod):
'''
Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)
over the finite field Z/(mod)Z.
Input:
N (int): maximum n
mod (int): a prime number. The order of the field Z/(mod)Z over which... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 565,013 | 565,014 | u497046426 | python |
p02769 | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 3*10**5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return 0
... | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 4*10**5 + 5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 565,027 | 565,028 | u461454424 | python |
p02769 | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 2*10**5 + 3
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return ... | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 4*10**5 + 5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 565,029 | 565,028 | u461454424 | python |
p02769 | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 2*10**5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return 0
... | #input
n, k = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 4*10**5 + 5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: return ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 565,030 | 565,028 | u461454424 | python |
p02769 | MOD = 10**9 + 7
inpl = lambda: list(map(int,input().split()))
def inv_mod(a, p=10**9+7):
p = abs(p)
a %= p
stack = []
p0 = p
while a > 1:
d, a, p = p//a, p%a, a
stack.append(d)
x, y = 1, 0
while stack:
d = stack.pop()
x, y = y-d*x, x
return x % p0
n, k = i... | MOD = 10**9 + 7
inpl = lambda: list(map(int,input().split()))
def inv_mod(a, p=10**9+7):
p = abs(p)
a %= p
stack = []
p0 = p
while a > 1:
d, a, p = p//a, p%a, a
stack.append(d)
x, y = 1, 0
while stack:
d = stack.pop()
x, y = y-d*x, x
return x % p0
n, k = i... | [
"call.remove"
] | 565,141 | 565,142 | u894258749 | python |
p02769 | def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def invmod(a, m):
g, x, y = xgcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
... | def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def invmod(a, m):
g, x, y = xgcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
... | [
"expression.operation.binary.add"
] | 565,147 | 565,148 | u486065927 | python |
p02769 | def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
n, k = map(int, input().split())
MOD = 1000000007
if n-1 > k:
ans = 1
com1 = 1
com2 = 1
for i in range(k):
com1 = com1 * (n-1-i) * modpo... | def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
n, k = map(int, input().split())
MOD = 1000000007
if n-1 > k:
ans = 1
com1 = 1
com2 = 1
for i in range(k):
com1 = com1 * (n-1-i) * modpo... | [
"expression.operation.binary.add"
] | 565,161 | 565,162 | u137913818 | python |
p02769 | def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
mod = 10**9 + 7
N = 2 * 10**5 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.appe... | def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
mod = 10**9 + 7
N = 2 * 10**5 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.appe... | [] | 565,171 | 565,172 | u886633618 | python |
p02769 | def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2] != 1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,mod):
x = extgcd(a,mod)[0]
return (mod + x % mod)% mod
def comb(n,k,mod):
c = 1
... | def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2] != 1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
return [w[0],w[1]]
def mod_inv(a,mod):
x = extgcd(a,mod)[0]
return (mod + x % mod)% mod
def comb(n,k,mod):
c = 1
... | [] | 565,173 | 565,174 | u918935103 | python |
p02769 | #coding:utf-8
class Combination:
def __init__(self,N,P=10**9+7):
if N > 10**7:
self.fact = lambda x: x * self.fact(x-1) % P if x > 2 else 2
self.perm = lambda x, r: x * self.perm(x-1,r-1) % P if r > 0 else 1
self.cmb = lambda n,r: (self.perm(n,min(n-r,r)) * pow(self.fact(... | #coding:utf-8
class Combination:
def __init__(self,N,P=10**9+7):
if N > 10**7:
self.fact = lambda x: x * self.fact(x-1) % P if x > 2 else 2
self.perm = lambda x, r: x * self.perm(x-1,r-1) % P if r > 0 else 1
self.cmb = lambda n,r: (self.perm(n,min(n-r,r)) * pow(self.fact(... | [] | 565,044 | 565,045 | u043048943 | python |
p02769 | N, K = map(int, input().split())
MOD = 10**9 + 7
MAX_N = 10**6 + 5
fact = [0]*(MAX_N)
fact_inv = [0]*(MAX_N)
fact[0] = 1
for i in range(MAX_N-1):
fact[i+1] = fact[i]*(i+1) % MOD
fact_inv[-1] = pow(fact[-1], MOD-2, MOD)
for i in range(MAX_N-2, -1, -1):
fact_inv[i] = fact_inv[i+1]*(i+1) % MOD
def comb(n, k):
... | N, K = map(int, input().split())
MOD = 10**9 + 7
MAX_N = 10**6 + 5
fact = [0]*(MAX_N)
fact_inv = [0]*(MAX_N)
fact[0] = 1
for i in range(MAX_N-1):
fact[i+1] = fact[i]*(i+1) % MOD
fact_inv[-1] = pow(fact[-1], MOD-2, MOD)
for i in range(MAX_N-2, -1, -1):
fact_inv[i] = fact_inv[i+1]*(i+1) % MOD
def comb(n, k):
... | [] | 565,048 | 565,049 | u503228842 | python |
p02769 | n, k = map(int, input().split())
mod = 10 ** 9 + 7
def comb(n, r):
if n < r:return 0
if n < 0 or k < 0:return 0
return fa[n] * fi[r] % mod * fi[n - r] % mod
fa = [1] * (n + 1)
fi = [1] * (n + 1)
for i in range(1, n + 1):
fa[i] = fa[i - 1] * i % mod
fi[i] = pow(fa[i], mod - 2, mod)
ans = 0
for i in r... | n, k = map(int, input().split())
mod = 10 ** 9 + 7
def comb(n, r):
if n < r:return 0
if n < 0 or k < 0:return 0
return fa[n] * fi[r] % mod * fi[n - r] % mod
fa = [1] * (n + 1)
fi = [1] * (n + 1)
for i in range(1, n + 1):
fa[i] = fa[i - 1] * i % mod
fi[i] = pow(fa[i], mod - 2, mod)
ans = 0
for i in r... | [
"expression.operation.binary.add"
] | 565,053 | 565,054 | u923270446 | python |
p02769 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
M = 10**9+7
N = 4*10**5+3 # 必要なテーブルサイズ
def cmb(n, r, M):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] * g2[n-r]) % M
g1 = [None] * (N... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
M = 10**9+7
N = 4*10**5+3 # 必要なテーブルサイズ
def cmb(n, r, M):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] * g2[n-r]) % M
g1 = [None] * (N... | [
"expression.operation.binary.remove"
] | 565,059 | 565,060 | u535803878 | python |
p02769 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
M = 10**9+7
N = 4*10**5+3 # 必要なテーブルサイズ
def cmb(n, r, M):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] * g2[n-r]) % M
g1 = [None] * (N... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
M = 10**9+7
N = 4*10**5+3 # 必要なテーブルサイズ
def cmb(n, r, M):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] * g2[n-r]) % M
g1 = [None] * (N... | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 565,061 | 565,060 | u535803878 | python |
p02769 | N,K=map(int, input().split())
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
n= 2*10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] ... | N,K=map(int, input().split())
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
n= 2*10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 565,066 | 565,067 | u784022244 | python |
p02769 | m=10**9+7;f=[1];n,k=map(int,input().split())
for i in range(10**6):f+=[f[i]*(i+1)%m]
def c(a,b):return f[a]*pow(f[b],m-2,m)*pow(f[a-b],m-2,m)%m
s=c(n*2-1,n-1)
if k>n-2:print(s)
else:print(s+(m-sum(c(n-1,i)*c(n,n-i)for i in range(n-1,k,-1))%m)%m) | m=10**9+7;f=[1];n,k=map(int,input().split())
for i in range(10**6):f+=[f[i]*(i+1)%m]
def c(a,b):return f[a]*pow(f[b],m-2,m)*pow(f[a-b],m-2,m)%m
s=c(n*2-1,n-1)
if k>n-2:print(s)
else:print((s+(m-sum(c(n-1,i)*c(n,n-i)for i in range(n-1,k,-1))%m))%m) | [
"call.arguments.change"
] | 565,068 | 565,069 | u227082700 | python |
p02769 | class Cmb:
def __init__(self, N, mod=10**9+7):
self.fact = [1,1]
self.fact_inv = [1,1]
self.inv = [0,1]
""" 階乗を保存する配列を作成 """
for i in range(2, N+1):
self.fact.append((self.fact[-1]*i) % mod)
self.inv.append((-self.inv[mod%i] * (mod//i))%mod)
... | class Cmb:
def __init__(self, N, mod=10**9+7):
self.fact = [1,1]
self.fact_inv = [1,1]
self.inv = [0,1]
""" 階乗を保存する配列を作成 """
for i in range(2, N+1):
self.fact.append((self.fact[-1]*i) % mod)
self.inv.append((-self.inv[mod%i] * (mod//i))%mod)
... | [
"expression.operation.binary.add"
] | 565,074 | 565,075 | u672475305 | python |
p02769 | n, k = map( int, input().split() )
mod = 10 ** 9 + 7
numer = [ 1 ] * ( n + 1 )
demon = [ 1 ] * ( n + 1 )
for i in range( 1, n + 1 ):
numer[ i ] = numer[ i - 1 ] * i % mod
demon[ n ] = pow( numer[ n ], mod - 2, mod )
for i in range( n, 0, -1 ):
demon[ i - 1 ] = ( demon[ i ] * i ) % mod
def nCr( n, r ):
if r ... | n, k = map( int, input().split() )
mod = 10 ** 9 + 7
numer = [ 1 ] * ( n + 1 )
demon = [ 1 ] * ( n + 1 )
for i in range( 1, n + 1 ):
numer[ i ] = numer[ i - 1 ] * i % mod
demon[ n ] = pow( numer[ n ], mod - 2, mod )
for i in range( n, 0, -1 ):
demon[ i - 1 ] = ( demon[ i ] * i ) % mod
def nCr( n, r ):
if r ... | [
"expression.operation.binary.remove"
] | 565,079 | 565,080 | u699008198 | python |
p02769 | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | [
"expression.operation.binary.add"
] | 565,081 | 565,082 | u380995377 | python |
p02769 | n, k = map(int,input().split())
mod = 10**9+7
#nCrをmodで割った余りを求める。Nに最大値を入れて使用。
N = n
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n,r,mod):
if r<0 or r>n :
return 0
r = min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
for i in range(2,N+1):
g1.append((g1[-1]*i)%mod)
... | n, k = map(int,input().split())
mod = 10**9+7
#nCrをmodで割った余りを求める。Nに最大値を入れて使用。
N = n
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n,r,mod):
if r<0 or r>n :
return 0
r = min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
for i in range(2,N+1):
g1.append((g1[-1]*i)%mod)
... | [
"call.remove"
] | 565,084 | 565,085 | u169350228 | python |
p02769 | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(co... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(co... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 565,097 | 565,098 | u346812984 | python |
p02769 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | [] | 565,133 | 565,134 | u375616706 | python |
p02768 | def modpow(a,b,mod):
ans=1
a=a%mod
while b>0:
if b%2==1:
ans=(ans*a)%mod
a=(a**2)%mod
b=b//2
return ans
N,A,B=map(int,input().split())
ans=modpow(2,N,10**9+7)-1
c=1
d=1
for i in range(A):
c=(c*(N-i))%(10**9+7)
for i in range(A):
d=(d*(i+1))%(10**9+7)
d=modpow(d,... | def modpow(a,b,mod):
ans=1
a=a%mod
while b>0:
if b%2==1:
ans=(ans*a)%mod
a=(a**2)%mod
b=b//2
return ans
N,A,B=map(int,input().split())
ans=modpow(2,N,10**9+7)-1
c=1
d=1
for i in range(A):
c=(c*(N-i))%(10**9+7)
for i in range(A):
d=(d*(i+1))%(10**9+7)
d=modpow(d,... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 565,212 | 565,213 | u444082822 | python |
p02769 | import sys
input = sys.stdin.readline
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 5+15 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, ... | import sys
input = sys.stdin.readline
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 2* 10 ** 5+2 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 565,224 | 565,225 | u950708010 | python |
p02769 | n,k=map(int,input().split())
mod=10**9+7
n_max=4*(10**5+1)
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
for i in reversed(range(n_max-1)):
FI[i]=(FI[i+1]*(i+1))%mod
def comb(x,y):
return (F[x]*FI[x-y]*FI[y])%mod
if k>=n-1:
... | n,k=map(int,input().split())
mod=10**9+7
n_max=4*(10**5+1)
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
for i in reversed(range(n_max-1)):
FI[i]=(FI[i+1]*(i+1))%mod
def comb(x,y):
return (F[x]*FI[x-y]*FI[y])%mod
if k>=n-1:
... | [] | 565,238 | 565,239 | u969190727 | python |
p02769 | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inver... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inver... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,248 | 565,249 | u476604182 | python |
p02769 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary... | 565,262 | 565,263 | u407160848 | python |
p02769 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary... | 565,262 | 565,264 | u407160848 | python |
p02769 | mod=10**9+7
n,k=map(int,input().split())
ans=1-k%2
coef1=n
coef2=n-1
for i in range(1,min(k+1,n)):
tmp=1
tmp*=coef1
tmp%=mod
tmp*=coef2
tmp%=mod
ans+=tmp
ans%=mod
coef1*=n-i
coef1%=mod
coef1*=pow(i+1,mod-2,mod)
coef1%=mod
coef2*=n-1-i
coef2%=mod
coef2*=pow(i+1,mod-2,mod)
coef2%=mod
print... | mod=10**9+7
n,k=map(int,input().split())
ans=1
coef1=n
coef2=n-1
for i in range(1,min(k+1,n)):
tmp=1
tmp*=coef1
tmp%=mod
tmp*=coef2
tmp%=mod
ans+=tmp
ans%=mod
coef1*=n-i
coef1%=mod
coef1*=pow(i+1,mod-2,mod)
coef1%=mod
coef2*=n-1-i
coef2%=mod
coef2*=pow(i+1,mod-2,mod)
coef2%=mod
print(ans... | [
"expression.operation.binary.remove"
] | 565,267 | 565,268 | u163320134 | python |
p02769 | def factorial(n, mod=10**9+7):
a = 1
for i in range(1,n+1):
a = a * i % mod
return a
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod=10**9+7):
... | def factorial(n, mod=10**9+7):
a = 1
for i in range(1,n+1):
a = a * i % mod
return a
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod=10**9+7):
... | [
"identifier.change"
] | 565,275 | 565,276 | u922449550 | python |
p02769 | import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-... | import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 565,286 | 565,287 | u513434790 | python |
p02769 | import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-... | import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 565,286 | 565,288 | u513434790 | python |
p02769 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"expression.operation.binary.remove"
] | 565,289 | 565,290 | u191874006 | python |
p02769 | n,k = map(int, input().split())
mod = 10**9 + 7
ans = 0
lim = 2*(10**5) + 5
mothers = [1] * lim
mothers_inv = [1] * lim
for i in range(1, lim):
mothers[i] = mothers[i-1] * i % mod
mothers_inv[i] = pow(mothers[i], mod-2, mod)
def calc(n,k):
child = mothers[n] * mothers_inv[n-k] % mod
mother_inv = moth... | n,k = map(int, input().split())
mod = 10**9 + 7
ans = 0
lim = 2*(10**5) + 5
mothers = [1] * lim
mothers_inv = [1] * lim
for i in range(1, lim):
mothers[i] = mothers[i-1] * i % mod
mothers_inv[i] = pow(mothers[i], mod-2, mod)
def calc(n,k):
child = mothers[n] * mothers_inv[n-k] % mod
mother_inv = moth... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,291 | 565,292 | u490642448 | python |
p02771 | a,b,c = map(int,input().split())
if a==b and b!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=c:print('Yes')
else:print('No') | a,b,c = map(int,input().split())
if a==b and b!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=a:print('Yes')
else:print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,297 | 565,298 | u773440446 | python |
p02771 | a, b, c = input().split()
ans = "No"
if (a == b and a != c) or (a == c and a != b) or (b == c and b != c):
ans = "Yes"
print(ans) | a, b, c = input().split()
ans = "No"
if (a == b and a != c) or (a == c and a != b) or (b == c and a != b):
ans = "Yes"
print(ans) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,299 | 565,300 | u544272759 | python |
p02771 | a,b,c=input().split()
if a==b==c:
print('No')
elif a!=b!=c:
print('No')
else:
print('Yes') | a,b,c=input().split()
if a==b==c:
print('No')
elif a!=b!=c!=a:
print('No')
else:
print('Yes')
| [
"control_flow.branch.if.condition.change"
] | 565,309 | 565,310 | u539367121 | python |
p02771 | A = input().split()
a = A.count(A[0])
b = A.count(A[1])
c = A.count(A[2])
if a == 1 or b == 1 or c == 1:
print("Yes")
else:
print("No")
| A = input().split()
a = A.count(A[0])
b = A.count(A[1])
c = A.count(A[2])
if a == 2 or b == 2 or c == 2:
print("Yes")
else:
print("No")
| [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 565,313 | 565,314 | u344888046 | python |
p02771 | i = map(int,input().split())
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No") | i = list(map(int,input().split()))
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No") | [
"call.add",
"call.arguments.change"
] | 565,315 | 565,316 | u763628696 | python |
p02771 | i = map(int,input(),split())
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No") | i = list(map(int,input().split()))
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No") | [
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 565,317 | 565,316 | u763628696 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.