input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,a,b = list(map(int,input().split()))
mod = 1000000007
def modpow(a,n,m):
x = 1
while n:
if n%2: x *= a
a *= a
a %= m
n //= 2
return x
def nCr(n,r,m):
a = b = 1
for i in range(r):
a *= n - i
b *= r - i
a %= m
b %=... | M = 10**9+7
n,a,b = list(map(int,input().split()))
def nCr(n,r,m):
a = b = 1
for i in range(r):
a = a * (n-i) % m
b = b * (r-i) % m
return a * pow(b, m-2, m) % m
ans = pow(2,n,M) - 1
ans -= nCr(n,a,M)
ans -= nCr(n,b,M)
ans %= M
if ans<0: ans += M
print(ans) | p02768 |
mod = 10**9+7
n,a,b = list(map(int,input().split()))
base = pow(2,n,mod)-1
def comb(n,k):
comb = 1
for i in range(n-k+1,n+1):
comb *= i
comb %= mod
for i in range(1, k+1):
comb *= pow(i,mod-2,mod)
comb %= mod
return comb
print(((base-comb(n,a)-comb(n,b))%mod)) | mod = 10**9+7
n,a,b = list(map(int,input().split()))
def comb(k):
m = 1
c = 1
for i in range(k):
m = m*(n-i)%mod
c = c*(i+1)%mod
return (m*pow(c,mod-2,mod)%mod)
print(((pow(2,n,mod)-1-comb(a)-comb(b))%mod)) | p02768 |
n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
def comb(n: int, k: int, MOD: int) -> int:
if n < k or n < 0 or k < 0:
return 0
k = min(k, n - k)
if k == 0:
return 1
iinv = [1] * (k + 1)
ans = n
for i in range(2, k + 1):
iinv[i] = MOD - iinv[MOD %... | n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
def comb(n: int, k: int, MOD: int) -> int:
if n < k or n < 0 or k < 0:
return 0
k = min(k, n - k)
if k == 0:
return 1
iinv = [1] * (k + 1)
ans = n
for i in range(2, k + 1):
iinv[i] = MOD - iinv[MOD %... | p02768 |
def main():
#input data
import sys
input = lambda:sys.stdin.readline().strip()
N,A,B = list(map(int,input().split()))
mod=10**9+7
#solve
#二項係数の和=2**n
#2**n-1-nCa-nCb
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def cmb(n, r, mod=10**9+7):
... | def main():
#input data
import sys
input = lambda:sys.stdin.readline().strip()
N,A,B = list(map(int,input().split()))
mod=10**9+7
#solve
#二項係数の和=2**n
#2**n-1-nCa-nCb
def cmb(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
... | p02768 |
def main():
#input data
import sys
input = lambda:sys.stdin.readline().strip()
N,A,B = list(map(int,input().split()))
mod=10**9+7
#solve
#二項係数の和=2**n
#2**n-1-nCa-nCb
def cmb(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
... | def main():
#input data
import sys
input = lambda:sys.stdin.readline().strip()
N,A,B = list(map(int,input().split()))
mod=10**9+7
#solve
#二項係数の和=2**n
#2**n-1-nCa-nCb
def cmb(n, r, mod=10**9+7):
c = 1
m = 1
r = min(n - r, r)
for... | p02768 |
n, a, b = list(map(int, input().split()))
mod = 10**9+7
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
# [x,y]
return [w[0], w[1]]
def mod_inv... | n, a, b = list(map(int, input().split()))
mod = 10**9+7
def binary(n):
return bin(n)[2:]
# a^x mod n : ans = pow_by_binary_exponentiation(2, 1000, 10**9+7)
def pow_by_binary_exponentiation(a, x, n):
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
... | p02768 |
from functools import reduce
N, A, B = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def f(A):
num = reduce(lambda x, y: x * y % MOD, list(range(N, N - A, -1)))
den = reduce(lambda x, y: x * y % MOD, list(range(1, A + 1)))
return num * pow(den, MOD - 2, MOD) % MOD
answer = pow(2, N, MOD) ... | from functools import reduce
def combinations_count_mod(n, r, m):
num = reduce(lambda x, y: x * y % m, list(range(n, n - r, -1)))
den = reduce(lambda x, y: x * y % m, list(range(1, r + 1)))
return num * pow(den, m - 2, m) % m
N, A, B = list(map(int, input().split()))
MOD = 10 ** 9 + 7
answer... | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
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,mod-2,mod)%mod
nca=comb(n,a,mod)
ncb=comb(n,b,mod)
ans=pow(2,n,mod)
ans=(ans-((nca+ncb)%mod+1))%mod
print(ans) | n,a,b=list(map(int,input().split()))
mod=10**9+7
def comb(n,r,mod):
p,q=1,1
for i in range(min(r,n-r)):
p=p*(n-i)%mod
q=q*(i+1)%mod
return p*pow(q,mod-2,mod)%mod
nca=comb(n,a,mod)
ncb=comb(n,b,mod)
ans=pow(2,n,mod)
ans=(ans-((nca+ncb)%mod+1))%mod
print(ans) | p02768 |
def main():
mod = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
ma = max(a, b)
tbl = [0] * (ma + 1)
# f = 1
# for i in range(1, ma + 1):
# f = (f * i) % mod
#
# invs = [1] * (ma + 1)
# invs[ma] = pow(f, mod - 2, mod)
# for x in range(ma - 1, 0, -1... | mod = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
def choose(n, a, mod=mod):
x, y = 1, 1
for i in range(a):
x = x * (n - i) % mod
y = y * (i + 1) % mod
return x * pow(y, mod - 2, mod)
ret = pow(2, n, mod)
ret -= 1
ret -= choose(n, a)
ret -= choose(n, b)
ret %=... | p02768 |
n,a,b=list(map(int,input().split()))
mod=(10**9)+7
ans=pow(2,n,mod)-1
comb=1
for i in range(n-a+1,n+1):
comb*=i
comb%=mod
for i in range(1,a+1):
comb*=pow(i,mod-2,mod)
comb%=mod
comb2=1
for i in range(n-b+1,n+1):
comb2*=i
comb2%=mod
for i in range(1,b+1):
comb2*=pow(i,mod-2,mo... | def main():
n,a,b=list(map(int,input().split()))
mod=(10**9)+7
ans=pow(2,n,mod)-1
comb=1
for i in range(n-a+1,n+1):
comb*=i
comb%=mod
for i in range(1,a+1):
comb*=pow(i,mod-2,mod)
comb%=mod
comb2=1
for i in range(n-b+1,n+1):
comb2*=i
... | p02768 |
n,a,b = [int(x) for x in input().split()]
ans = 0
mod = 10**9+7
ans = (pow(2,n,mod)-1)%mod
com1 = 1
for i in range(n-a+1,n+1):
com1 = com1*i%mod
for i in range(1,a+1):
com1 = com1 * pow(i,mod-2,mod)%mod
com2 = 1
for i in range(n-b+1,n+1):
com2 = com2*i%mod
for i in range(1,b+1):
com2 = ... | n,a,b = [int(x) for x in input().split()]
ans = 0
mod = 10**9+7
ans = (pow(2,n,mod)-1)%mod
com1 = 1
for i in range(n-a+1,n+1):
com1 = com1*i%mod
for i in range(1,a+1):
com1 = com1 * pow(i,mod-2,mod)%mod
com2 = 1
for i in range(n-b+1,n+1):
com2 = com2*i%mod
x = 1
for i in range(1,b+1):
... | p02768 |
MOD = 1000000007
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
def __int__(self):
return self.x
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(othe... | MOD = 1000000007
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
def __int__(self):
return self.x
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(othe... | p02768 |
n,a,b = list(map(int,input().split()))
m = 10**9 + 7
comb_a = 1
comb_b = 1
a_num = list(range(1,a+1))
j = 0
for i in range(1,a+1):
comb_a *= (n-i+1)
comb_a *= pow(a_num[i-1],m-2,m)
comb_a = comb_a % m
b_num = list(range(1,b+1))
j = 0
for i in range(1,b+1):
comb_b *= (n-i+1)
comb_b ... | def comb_mod(n,r,m):
ans = 1
for i in range(1,r+1):
ans *= (n-i+1) % m
ans *= pow(i,m-2,m) % m
ans = ans % m
return ans
n,a,b = list(map(int,input().split()))
m = 10**9 + 7
ans = pow(2,n,m) - comb_mod(n,a,m) - comb_mod(n,b,m) - 1
print((int(ans) % m)) | p02768 |
def modpow(a,n,mod=10**9+7):
res=1
while n>0:
if n&1:
res=res*a%mod
a=a*a%mod
n>>=1
return res%mod
def modcmb(n,r,mod=10**9+7):
res=1
div=min(r,n-r)
for i in range(div):
res=res*(n-i)*modpow(div-i,mod-2)%mod
return res%mod
n,a,b=[... | def modcmb(n,r,mod=10**9+7):
res=1
div=min(r,n-r)
for i in range(div):
res=res*(n-i)*pow(div-i,mod-2,mod)%mod
return res%mod
n,a,b=[int(i) for i in input().split()]
mod=10**9+7
ans=pow(2,n,mod)-1
ans-=modcmb(n,a)
ans%=mod
ans-=modcmb(n,b)
ans%=mod
print(ans) | p02768 |
n, a, b = list(map(int,input().split()))
MOD = 10**9 + 7
ans = pow(2,n,MOD)-1
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
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 ... | MOD = 10**9 + 7
def nCr(n, r, MOD):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
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 pivot > 1:
offs... | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10 ** 9 + 7
# 乗法のmod逆元 (mod-2乗)
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
# nCr mod m
# modinvが必要
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modin... | n,a,b = list(map(int,input().split()))
mod = 10 ** 9 + 7
# 乗法のmod逆元 (mod-2乗)
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
# nCr mod m
# modinvが必要
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
x = 1
y = 1
for i in range(r):
x *= (n - i)
... | p02768 |
mod = 10**9 +7
n, a, b = list(map(int, input().split()))
nb = str(bin(n))[2:]
nblis = []
for k in range(len(nb)):
if nb[-k-1] == '1':
nblis.append(k)
two = [2]
for k in range(len(nb)-1):
two.append(two[-1]*two[-1]%mod)
ans = 1
for item in nblis:
ans = ans * two[item] %mod
bi = str(b... | mod = 10**9 +7
n, a, b = list(map(int, input().split()))
nb = str(bin(n))[2:]
nblis = []
for k in range(len(nb)):
if nb[-k-1] == '1':
nblis.append(k)
two = [2]
for k in range(len(nb)-1):
two.append(two[-1]*two[-1]%mod)
ans = 1
for item in nblis:
ans = ans * two[item] %mod
bi = str(b... | p02768 |
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
def comb(n, k):
x, y = 1, 1
for i in range(n, n-k, -1):
x = x * i % MOD
for i in range(2, k+1):
y = y * pow(i, MOD-2, MOD) % MOD
return x*y % MOD
ans = (pow(2, n, MOD)-1-comb(n,a)-comb(n,b)) % MOD
print(ans) | from functools import reduce
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
def comb(n, k):
def mul(a, b):
return a*b%MOD
x = reduce(mul, list(range(n, n-k, -1)))
y = reduce(mul, list(range(1, k+1)))
return x*pow(y, MOD-2, MOD) % MOD
ans = (pow(2, n, MOD)-1-comb(n,a)-comb... | p02768 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | p02768 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9+7
n,a,b = list(map(int, input().split()))
def comb(n, k):
c = 1
for i in range(n - k + 1, n + 1):
c *= i
c %= mod
for i in range(1, k + 1):
c *= pow(i, mod - 2, mod)
c %= mod
... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9+7
n,a,b = list(map(int, input().split()))
# def comb(n, k):
# c = 1
# for i in range(n - k + 1, n + 1):
# c *= i
# c %= mod
#
# for i in range(1, k + 1):
# c *= pow(i, mod - 2, mod)
# ... | p02768 |
n,a,b=list(map(int,input().split()))
m=10**9+7
def c(x,r=1):
for i in range(x):r=r*(n-i)*pow(i+1,m-2,m)%m
return r
print(((pow(2,n,m)-1-c(a)-c(b))%m)) | n,a,b=list(map(int,input().split()))
m=10**9+7
s=r=1
for i in range(b):
r=r*(n-i)*pow(i+1,m-2,m)%m
if i+1in[a,b]:s+=r
print(((pow(2,n,m)-s)%m)) | p02768 |
def get_exp_mod(base, exp, mod):
exp_bin = str(format(exp, 'b')) # ２進表現
res = 1
for i in range(len(exp_bin)):
if exp_bin[-i - 1] == '1':
res = res * base % mod
base = base * base % mod # base^2^nをmodで割ったあまり
return res
mod = 10 ** 9 + 7
n, a, b = list(map(int,... | def get_exp_mod(base, exp, mod):
exp_bin = str(format(exp, 'b')) # ２進表現
res = 1
for i in range(len(exp_bin)):
if exp_bin[-i - 1] == '1':
res = res * base % mod
base = base * base % mod # base^2^nをmodで割ったあまり
return res
def comb(n, r, mod):
X = 1
Y = 1... | p02768 |
from functools import reduce
def comb(n, k, p):
a = reduce(lambda x,y: x*y%p, list(range(n,n-k,-1)))
b = reduce(lambda x,y: x*y%p, list(range(1,k+1)))
return (a*pow(b, p-2, p))%p
n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
print(((pow(2,n,MOD) - 1 - comb(n, a, MOD) - comb(n, ... | 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 = list(map(int, input().split()))
MOD... | p02768 |
n,a,b=list(map(int,input().split()))
mod=pow(10,9)+7
def pow_speed(x,n,mod):
res = 1
while n > 0:
if n & 1 == 1:
res *= x
x *= x
x%=mod
n >>= 1
return res
def comb(n,x):
rec=1
for i in range(n-x+1,n+1):
rec=rec*i%mod
rec2=1
... | n,a,b=list(map(int,input().split()))
mod=10**9+7
#modあり
def pow_speed(x,n):
res = 1
while n > 0:
if n & 1 == 1:
res *= x
x *= x
x%=mod
n >>= 1
return res
#nCx(mod)
def comb_speed(n,x):
rec=1
for i in range(n-x+1,n+1):
rec=rec*i%... | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
ans = pow(2,n,mod)-1
comb1 = 1
for i in range(n-a+1, n+1):
comb1 *= i
comb1 %= mod
for i in range(1, a+1):
comb1 *= pow(i, mod-2, mod)
comb1 %= mod
comb2 = 1
for i in range(n-b+1, n+1):
comb2 *= i
comb2 %= mod
for i in ran... | 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
n,a,b = list(map(int,input().split()))
mod = 10**9+7
print(((pow(2,n,mod) - 1 - comb(n,a) - comb(... | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
a = min(a,n-a)
b = min(b,n-b)
m = max(a,b)
X = [0]*(m+1)
Y = [0]*(m+1)
X[0] = 1
X[1] = n
Y[0] = Y[1] = 1
for i in range(2,m+1):
X[i] = X[i-1]*(n-i+1)%mod
Y[i] = Y[i-1]*i%mod
ans = (((pow(2,n,mod)-1)%mod-X[a]*pow(Y[a],mod-2,mod)%mod)%mod-X... | n,a,b = list(map(int,input().split()))
mod = 10**9+7
def combmod(n,k,mod):
x = y = 1
for i in range(min(k,n-k)):
x = x*(n-i)%mod
y = y*(i+1)%mod
return x * pow(y, mod-2, mod) % mod
ans = (((pow(2, n, mod) - 1)%mod - combmod(n, a, mod))%mod - combmod(n, b, mod))%mod
print(ans) | p02768 |
n,a,b = [int(i) for i in input().split()]
mod = 10**9+7
def mpow(a,n):
if n == 1:
return a
x = mpow(a,n//2)
ans = x*x%mod
if n%2==1:
ans *= a
return ans
def comb(n,a,b):
if a < b:
s, l = a, b
else:
s, l = b, a
rs = 1
for i in range(s):
rs = rs*(n-i)%mod
rl =... | import math
n,a,b = [int(i) for i in input().split()]
mod = 10**9+7
def comb(n,k):
ans = 1
for i in range(k):
ans = ans*(n-i)%mod
for i in range(1,k+1):
ans = ans*pow(i,mod-2,mod)%mod
return ans
print(((pow(2,n,mod)-1-comb(n,a)-comb(n,b))%mod))
# print(comb(n,a))
| p02768 |
n,a,b = [int(i) for i in input().split()]
mod = 10**9+7
def mpow(a,n):
if n == 1:
return a
x = mpow(a,n//2)
ans = x*x%mod
if n%2==1:
ans *= a
return ans
def comb(n,a,b):
if a < b:
s, l = a, b
else:
s, l = b, a
rs = 1
for i in range(s):
rs = rs*(n-i)%mod
rl =... | def comb_mod(n,r):
mod = 10**9+7
ans = 1
for i in range(r):
ans *= n-i
ans %= mod
for i in range(1,r+1):
ans *= pow(i,mod-2,mod)
ans %= mod
return ans
def solve():
n, a, b = list(map(int, input().split()))
mod = 10**9+7
ans = pow(2,n,mod)-co... | p02768 |
def comb_mod(n,r):
mod = 10**9+7
ans = 1
for i in range(r):
ans *= n-i
ans %= mod
for i in range(1,r+1):
ans *= pow(i,mod-2,mod)
ans %= mod
return ans
def solve():
n, a, b = list(map(int, input().split()))
mod = 10**9+7
ans = pow(2,n,mod)-co... | def comb_mod(n,r):
mod = 10**9+7
ans = 1
for i in range(r):
ans *= n-i
ans %= mod
for i in range(1,r+1):
ans *= pow(i,-1,mod)
ans %= mod
return ans
def solve():
n, a, b = list(map(int, input().split()))
mod = 10**9+7
ans = pow(2,n,mod)-comb_... | p02768 |
import math
N ,a,b= list(map(int,input().split(' ')))
M = 10**9+7
def pow(x,n):
if n==0:
return 1
res = pow((x*x)%M,n//2)
if (n%2)==1:
res = (res*x)%M
return res
def power(x,n):
res = 1
if(n>0):
res = power(x,n//2)
if (n%2)==0:
... | N ,a,b= list(map(int,input().split(' ')))
M = 10**9+7
def pow(x,n):
if n==0:
return 1
res = pow((x*x)%M,n//2)
if (n%2)==1:
res = (res*x)%M
return res
def power(x,n):
res = 1
if(n>0):
res = power(x,n//2)
if (n%2)==0:
res = (res*r... | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
total = pow(2,n,mod) - 1 # 制約なしの全パターン_n**2-1※'-1'は0本の花束
# n個からr個を選択した時のパターン総数
# n! / (r! * (n-r)!) → nが大き過ぎて出来ない →変形→ n*(n-1)*･･･(n-r+1) ↓関数化
def nCr(n, r, mod):
numerator=1 #分子
for i in range(n-r+1, n+1):
numerator = (numerator*i) % mod
... | n,a,b = list(map(int,input().split()))
mod = 10**9+7
total = pow(2,n,mod) - 1 # 制約なしの全パターン_n**2-1※'-1'は0本の花束
# n個からr個を選択した時のパターン総数_組み合わせ重複なし
# n! / (r! * (n-r)!) → nが大き過ぎて出来ない →変形→ n*(n-1)*･･･(n-r+1)/r! ↓関数化
def nCr(n, r, mod):
numerator=1 #分子_n*(n-1)*･･･(n-r+1)
for i in range(n-r+1, n+1):
n... | p02768 |
# coding: utf-8
n,a_,b_=list(map(int,input().split()))
l=[min(a_,n-a_),min(b_,n-b_)]
a,b=min(l),max(l)
mod=10**9+7
def pow_k(x,n):
k=1
#kは漏れたやつ
while n>1:
if n%2==1:
k*=x
n-=1
k=k%mod
x**=2
x=x%mod
n//=2
return (k ... | # coding: utf-8
n,a_,b_=list(map(int,input().split()))
l=[min(a_,n-a_),min(b_,n-b_)]
a,b=min(l),max(l)
mod=10**9+7
def pow_k(x,n):#いらない
k=1
#kは漏れたやつ
while n>1:
if n%2==1:
k*=x
n-=1
k=k%mod
x**=2
x=x%mod
n//=2
retur... | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
def pow2(n,base):
if n==1:return base
if n%2==0:return pow2(n//2,base)**2%mod
else:return base*pow2(n//2,base)**2%mod
def fac(n,a):
ans=1
for i in range(n,n-a,-1):
ans*=i
ans%=mod
return ans
def inv_fac(n):
a... | n,a,b=list(map(int,input().split()))
mod=10**9+7
def fac(n,a):
ans=1
for i in range(n,n-a,-1):
ans*=i
ans%=mod
return ans%mod
def inv_fac(n):
ans=pow(fac(n,n-1),mod-2,mod)
return ans%mod
ans=pow(2,n,mod)-fac(n,a)*inv_fac(a)-fac(n,b)*inv_fac(b)
print((ans%mod-1... | p02768 |
n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
N = min(n, 2 * 10**5)
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
def comb(n, r):
return fac[n] * ( finv[r] * finv[n-r] % mod ) % mod
for i in range(2, N + 1):
fac.append( ( fac[-1] * i ) % mod )
inv.append( mod - ( inv[mod % i] * (mod // i)... | n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
def frac_rev(n, r):
x = 1
for i in range(n, n-r, -1):
x = x * i % mod
return x
def frac(n):
x = 1
for i in range(1, n+1):
x = x * i % mod
return x
print((( pow(2, n, mod) - 1 - frac_rev(n, a) * pow(frac(a), mod-2, mod) %... | p02768 |
# refer to https://qiita.com/k_karen/items/653ba7025a92f5ac1363
# ONE = '1'.freeze
MOD = (10**9) + 7
# def inv(x)
# res = 1 # 最終的に x^(MOD-2) になる変数です
# beki = x # x^2^n を格納する変数です
# # MOD-2の２進数展開を下位のbitから見ていきます。
# (MOD - 2).to_s(2).reverse.chars do |digest|
# # bitが立っている <=> digest == ONE
# ... | mod = 10 ** 9 + 7
def fact(n,k,mod):
res = 1
for i in range(k):
res = res * (n-i) % mod
return res % mod
n, a, b = list(map(int, input().split()))
ans = pow(2,n,mod) - 1
ans = (ans - fact(n,a,mod)*pow(fact(a,a,mod),mod-2,mod)) % mod
ans = (ans - fact(n,b,mod)*pow(fact(b,b,mod),mod-2... | p02768 |
mod = 10 ** 9 + 7
# permutation: n * (n-1) * …… * (n-k+1) (mod p)
def prm(n, k, p=10**9+7):
res = 1
for i in range(k):
res = res * (n-i) % p
return res
# combination: nPk / k! (mod p), note: p must be a prime number
def cmb(n, k, p=10**9+7):
k = min(k, n - k)
return prm( n, k )... | mod = 10 ** 9 + 7
# permutation: n * (n-1) * …… * (n-k+1) (mod p)
def prm(n, k, p=10**9+7):
res = 1
for i in range(k):
res = res * (n-i) % p
return res
# note: p must be a prime number
# フェルマーの小定理より
def modinv(a, p):
return pow( a, p-2, p )
# combination: nPk / k! (mod p), note:... | p02768 |
import sys
import math
MOD = 10 ** 9 + 7
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
#[x,y]
return [w[0],w[1]]
def mod_inv(a):
x = extgcd(a,MOD)[0... | import sys
import math
MOD = 10 ** 9 + 7
input = sys.stdin.readline
n,a,b = list(map(int,input().split()))
x1 = 1
a = min(a,n-a)
b = min(b,n-b)
if a > b:
a,b = b,a
for i in range(n-a+1,n+1):
x1 = x1 * i % MOD
x11 = 1
for i in range(1,a+1):
x11 = x11 * i % MOD
x1 = x1 * pow(x11,MOD-2,MOD... | p02768 |
n,a,b = [int(x) for x in input().split()]
mod = 10**9 + 7
def comb(x,y):
child = 1
mother = 1
for i in range(y):
child = child * (x-i)%mod
mother = mother * (i+1)%mod
return child * pow(mother,mod-2,mod) % mod
ans = pow(2,n,mod) - 1
ans -= comb(n,a)
ans %= mod
ans -= comb(n,b... | n,a,b = [int(x) for x in input().split()]
mod = 10**9 + 7
def comb(x,y):
child = 1
mother = 1
for i in range(y):
child = child * (x-i)%mod
mother = mother * (i+1)%mod
return child * pow(mother,mod-2,mod) % mod
ans = pow(2,n,mod) - 1 - comb(n,a) - comb(n,b)
print((ans%mod)) | p02768 |
M=10**9+7
n,a,b=list(map(int,input().split()))
s=r=1
for i in range(b):r=r*(n-i)*pow(i+1,M-2,M)%M;s+=r*(i+1in(a,b))
print(((pow(2,n,M)-s)%M)) | M=10**9+7
n,a,b=list(map(int,input().split()))
s=r=1
for i in range(b):r=r*(n-i)*pow(i+1,M-2,M)%M;s+=r*(i+1==a)
print(((pow(2,n,M)-s-r)%M)) | p02768 |
# AtCoder用のライブラリ
# 参照
# https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
# a ** n mod m
def mod_pow(a, n, m=10 ** 9 + 7):
res = 1
while n > 0:
if n & 1 == 1:
res = res * a % m
a = a * a % m
n >>= 1
return res
# aの-1乗をmで割ったときの商を求める
def mod_inv(a, m=1... | # AtCoder用のライブラリ
# 参照
# https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
n, a, b = list(map(int, input().split()))
MOD = 10 ** 9 + 7
# a ** n mod m
def mod_pow(a, n, m=10 ** 9 + 7):
res = 1
while n > 0:
if n & 1 == 1:
res = res * a % m
a = a * a % m
n >>... | p02768 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p02768 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p02768 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p02768 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p02768 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p02768 |
def modinv(a,m):
return pow(a,m-2,m)
n,a,b = list(map(int,input().split()))
P = 10**9+7
nCa = 1
for i in range(1,a+1):
nCa = nCa*(n+1-i)*modinv(i,P)%P
nCb = nCa
for j in range(a+1,b+1):
nCb = nCb*(n+1-j)*modinv(j,P)%P
ans = (pow(2,n,P) -1 - nCa - nCb + 2*P)%P
print(ans)
| def comb(n, r, mod):
r = min(r, n-r)
mol = 1
for i in range(n-r+1, n+1):
mol = (mol * i) % mod
deno = 1
for i in range(1, r+1):
deno = (deno * i) % mod
ret = mol * pow(deno, mod-2, mod) % mod
return ret
n,a,b = list(map(int,input().split()))
P = 10**9+7
nCa ... | p02768 |
import math
import sys
sys.setrecursionlimit(int(10**9))
mod = 10**9 + 7
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y/2)**2 % mod
else : return power(x, y//2)**2 * x % mod
def fact(n):
if n == 1:
... | import math
import sys
sys.setrecursionlimit(int(10**9))
mod = 10**9 + 7
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y/2)**2 % mod
else : return power(x, y//2)**2 * x % mod
def fact(n):
if n == 1:
... | 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 = (mol... | 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 = (mol... | p02768 |
n,a,b=list(map(int, input().split()))
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, MOD-2, MOD) % MOD
mod=10**9+7
A=comb(n,a,mod)
B=comb(n,b,mod)
C=pow(2,n,mod)
if n==2:
print((0))
else:
print... | n,a,b=list(map(int, input().split()))
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, MOD-2, MOD) % MOD
mod=10**9+7
if n==2:
print((0))
else:
print(((pow(2,n,mod)-1-comb(n,a,mod)-comb(n,b,mod))%mod)) | p02768 |
n,a,b=list(map(int, input().split()))
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, MOD-2, MOD) % MOD
mod=10**9+7
if n==2:
print((0))
else:
print(((pow(2,n,mod)-1-comb(n,a,mod)-comb(n,b,mod))%mod)) | n,a,b=list(map(int, input().split()))
def comb(n, r,mod):
r=min(r,n-r)
p, q = 1, 1
for i in range(r):
p = p * (n-i) % mod
q = q * (i+1) % mod
return p * pow(q, mod-2, mod) % mod
mod=10**9+7
if n==2:
print((0))
else:
print(((pow(2,n,mod)-1-comb(n,a,mod)-comb(n,b,mod))%mod)) | p02768 |
def sq(a, b, mod): # aのb乗を剰余,kは初期値#20191116-D-Knight
if b == 0:
return 1
elif b % 2 == 0:
return sq(a, b // 2, mod)**2 % mod
else:
return sq(a, b - 1, mod) * a % mod
def nCk(n, k, mod=10 ** 9 + 7):
x = max(k, n - k)
y = min(k, n - k)
kkai = 1
for i in ... | def sq(a, b, mod): # aのb乗を剰余,kは初期値#20191116-D-Knight
if b == 0:
return 1
elif b % 2 == 0:
return sq(a, b // 2, mod)**2 % mod
else:
return sq(a, b - 1, mod) * a % mod
def nCk(n, k, mod=10 ** 9 + 7):
x = max(k, n - k)
y = min(k, n - k)
kkai = 1
for i in ... | p02768 |
def cmb(n, r, p):
r = min(r, n - r)
res = 1
for i in range(r):
res *= pow(i+1, p-2, p) # 分母の逆元(フェルマーの定理)
res *= n-i # 分子
res %= p
return res
p = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
ans = pow(2, n, p) - 1
ans -= cmb(n, a, p) + cmb(n, b, p)
print((... | from functools import reduce
def cmb(n, r, p):
r = min(n - r, r)
if r == 0:
return 1
numer = reduce(lambda x, y: (x*y)%p, list(range(n, n - r, -1)))
denom = reduce(lambda x, y: (x*y)%p, list(range(1, r + 1)))
return (numer * pow(denom, p-2, p)) % p
p = 10 ** 9 + 7
n, a, b = list... | p02768 |
from math import factorial
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
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, m... | import time
from math import factorial
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
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... | p02768 |
n, a, b = list(map(int, input().split()))
MOD = 10**9+7
def COM(n, r):
X = Y = 1
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
Y = pow(Y, MOD-2, MOD)
while 0 < r:
X = X*n % MOD
n -= 1
r -= 1
return X*Y
ans = pow(2, n, MOD)... | n, a, b = list(map(int, input().split()))
MOD = 10**9+7
def COM(n, r):
X = Y = 1
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
Y = pow(Y, MOD-2, MOD)
return X*Y
ans = pow(2, n, MOD)-1 - COM(n, a)-COM(n, b)
ans %= MOD
print(... | p02768 |
n, a, b = list(map(int, input().split()))
MOD = 10**9+7
def COM(n, r):
X = Y = 1
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
Y = pow(Y, MOD-2, MOD)
return X*Y
ans = pow(2, n, MOD)-1 - COM(n, a)-COM(n, b)
ans %= MOD
print(... | n, a, b = list(map(int, input().split()))
MOD = 10**9+7
ans = pow(2, n, MOD)-1
X = Y = 1
for i in range(1, b+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
if i == a or i == b:
ans -= X*pow(Y, MOD-2, MOD)
print((ans % MOD)) | p02768 |
class Combination:
'''MOD上の
計算量：階乗・逆元テーブルの作成O(N)
nCkを求めるO(1)'''
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]
s... | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
... | p02768 |
class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
... | import sys
input = sys.stdin.buffer.readline
def combination(k, r, MOD):
"""kCrを求める"""
if k < r:
return 0
r = min(r, k - r)
numer, denom = 1, 1
for l in range(r):
numer *= (k - l)
numer %= MOD
denom *= l + 1
denom %= MOD
return numer * pow... | p02768 |
n,a,b = list(map(int,input().split()))
M = 10**9+7
# 2**n
twon = pow(2,n,M)
# nCr+1 = nCr * (n-r)/(r+1)
# nCr = A(r)とおくと ※nは固定
# A(r+1) = A(r) * (n-r)/(r+1)
# ここでmod M では、フェルマーの小定理より
# 1/(r+1) === (r+1)**(M-2) ※===は合同記号の意味
# よって A(r+1) = A(r) * (n-r) * (r+1)**(M-2)
L = [0] * (2*(10**5) + 1)
L[0] = 1
f... | import time
n,a,b = list(map(int,input().split()))
start = time.time() # 時間計測開始
M = 10**9+7
# 2**n
twon = pow(2,n,M)
# nCr+1 = nCr * (n-r)/(r+1)
# nCr = A(r)とおくと ※nは固定
# A(r+1) = A(r) * (n-r)/(r+1)
# ここでmod M では、フェルマーの小定理より
# 1/(r+1) === (r+1)**(M-2) ※===は合同記号の意味
# よって A(r+1) = A(r) * (n-r) * (r+... | p02768 |
n, a, b = list(map(int, input().split()))
# 全通り - nCa - nCb
mod = 10 ** 9 + 7
def inv(x):
return pow(x, mod - 2, mod)
# n ~ n - k + 1
def c(n, k):
res = 1
for i in range(0, k):
res = res * (n - i) * inv(i + 1) % mod
return res
print((((pow(2, n, mod) - c(n, a) - c(n, b) ... | n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
def inv(x):
return pow(x, mod - 2, mod)
def c(n, k):
ue, sita = 1, 1
for i in range(0, k):
ue = ue * (n - i) % mod
sita = sita * (i + 1) % mod
return ue * inv(sita) % mod
print((((pow(2, n, mod) - c(n, a) - c(n... | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
def comb(n,k):
temp=1
k=min(k,n-k)
for i in range(1,k+1):
temp=temp*pow(i,mod-2,mod)
temp=temp*(n-i+1)%mod
return temp%mod
#二分累乗法を勉強する
ans=pow(2,n,mod)-1-comb(n,a)-comb(n,b)
print((ans%mod)) | n,a,b=list(map(int,input().split()))
mod=10**9+7
def C(n,k,mod):
k=min(k,n-k)
comb=1
for i in range(k):
temp=(n-i)*pow(i+1,mod-2,mod)
comb=comb*temp%mod
return comb
ans=pow(2,n,mod)-1-C(n,a,mod)-C(n,b,mod)
print((ans%mod)) | p02768 |
def cmb(n, r, p):
# nume/deno === nume * pow(deno, p - 2, p) (mod p)
nume, deno = 1, 1
for i in range(r):
nume = nume * (n - i) % p
deno = deno * (i + 1) % p
return nume * pow(deno, p - 2, p) % p
if __name__ == "__main__":
n, a, b = list(map(int, input().split()))
p ... | def comb(n, r, p):
num, den = 1, 1
r = min(r, n - r)
for i in range(1, r + 1):
num = num * (n - i + 1) % p
den = den * i % p
return num * pow(den, p - 2, p) % p
n, a, b = list(map(int, input().split()))
MOD = 1_000_000_007
ans = pow(2, n, MOD)
ans %= MOD
ans -= comb(n, a, ... | p02768 |
n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
class ModInt:
def __init__(self, num, mod):
self.num = num
self.mod = mod
def __str__(self):
return str(self.num)
def __repr__(self):
return "ModInt(num: {}, mod: {}".format(self.num, self.mod)
... | n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
MAX = 2 * 10 ** 5
fact = [1] * (MAX + 1)
for i in range(1, MAX + 1):
fact[i] = (fact[i-1] * i) % mod
inv = [1] * (MAX + 1)
for i in range(2, MAX + 1):
inv[i] = inv[mod % i] * (mod - mod // i) % mod
ans = pow(2, n, mod) - 1
def com... | p02768 |
M = 10**9 + 7
n,a,b = list(map(int, input().split()))
def modinv(n):
return pow(n, M-2, M)
def comb(n, r):
num = 1
for i in range(n,n-r,-1):
cur = i
while cur%M == 0:
cur //= M
num = (num*cur)%M
denom = 1
for i in range(1,r+1):
cur = i
... | M = 10**9 + 7
n,a,b = list(map(int, input().split()))
def modinv(n):
return pow(n, M-2, M)
def comb(n, r):
num = denom = 1
for i in range(1,r+1):
num = (num*(n+1-i))%M
denom = (denom*i)%M
return num * modinv(denom) % M
print(((pow(2, n, M) - comb(n, a) - comb(n, b) - 1) %... | p02768 |
from math import factorial
n, a, b = list(map(int, input().split()))
mod = 10**9+7
def inv(a, mod):
r = [1, 0, a]
w = [0, 1, mod]
while w[2] != 1:
q = r[2]//w[2]
r_new = [r[0]-q*w[0], r[1]-q*w[1], r[2]-q*w[2]]
r = w
w = r_new
x, y = w[0], w[1] # a*x+y*... | n, a, b = list(map(int, input().split()))
mod = 10**9+7
def comb(x, y):
numer = 1
denom = 1
for i in range(1, y+1):
numer *= n+1-i
numer %= mod
denom *= i
denom %= mod
denom = pow(denom, mod-2, mod)
return numer * denom
print(((pow(2, n, mod)-1-c... | p02768 |
import math
n,a,b = list(map(int,input().split()))
def mod_inv(x,mod):
return pow(x,mod-2,mod)
def mod_inv_table(k):
table = [-1] * (k+1)
for i in range(1,k+1):
table[i] = mod_inv(i,10**9+7)
return table
def binomial(n,k,table):
ret = 1
for i in range(k):
ret ... | n,a,b = list(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)... | p02768 |
mod = 1000000007
def pw(x, n):
if n == 0: return 1
elif n == 1: return x
elif n % 2 == 0:
return pw(x, n // 2) ** 2 % mod
else:
return x * pw(x, n // 2) ** 2 % mod
def dv(x, y):
return x * pow(y, mod - 2, mod) % mod
def comb(n, r):
p, q = 1, 1
if n < r or n ... | def dv(x, y, mod):
# x / y = x * (y ** (mod - 2))
return x * pow(y, mod - 2, mod) % mod
def comb(n, r, mod):
# p / q = p * (q ** (mod - 2))
p, q = 1, 1
if n < r or n < 0 or r < 0: return 0
for i in range(r):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return dv(p,... | p02768 |
n, a, b = list(map(int, input().split()))
MOD = 1000000007
def comb(n, r):
x = 1
y = 1
for i in range(r):
x = x * (n - i) % MOD
y = y * (i + 1) % MOD
return x * pow(y, MOD - 2, MOD) % MOD
ans = pow(2, n, MOD)
ans -= 1
ans -= comb(n, a)
ans -= comb(n, b)
while ans < 0:
... | n, a, b = list(map(int, input().split()))
MOD = 1000000007
ans = pow(2, n, MOD)
ans -= 1
x = 1
y = 1
for i in range(b):
x = x * (n - i) % MOD
y = y * (i + 1) % MOD
if i == a - 1:
ans -= x * pow(y, MOD - 2, MOD) % MOD
ans -= x * pow(y, MOD - 2, MOD) % MOD
while ans < 0:
ans... | p02768 |
n, a, b = list(map(int, input().split(' ')))
# 二項係数 mod [検索]
mmm = 1000000000 + 7
fac = []
inv = []
inv_fac = []
def init(n):
fac.append(1)
fac.append(1)
inv.append(0)
inv.append(1)
inv_fac.append(1)
inv_fac.append(1)
for i in range(2, n):
fac.append(fac[-1] * i % mmm... | n, a, b = list(map(int, input().split(' ')))
# 二項係数 mod [検索]
mmm = 1000000000 + 7
fac = []
inv = []
inv_fac = []
def init(n):
fac.append(1)
fac.append(1)
inv.append(0)
inv.append(1)
inv_fac.append(1)
inv_fac.append(1)
for i in range(2, n):
fac.append(fac[-1] * i % mmm... | p02768 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.... | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
def repmod(n,m):
if n==1:return 2
nn = n // 2
te = repmod(nn, m)
if n%2==0:
ans=(te*te)%mod
return ans
elif n%2==1:
ans=(2*te*te)%mod
return ans
def extgcd(a,b):
a0,b0=a,b
x0,y0=1,0
x1,y1=... | def inv(N):
#n^-1
inv=[1,1]
for i in range(2,N+1):
inv.append(mod-mod//i*inv[(mod%i)]%mod)
return inv
n,a,b=list(map(int,input().split()))
mod=10**9+7
def repmod(n,m):
if n==1:return 2
nn = n // 2
te = repmod(nn, m)
if n%2==0:
ans=(te*te)%mod
r... | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
import sys
sys.setrecursionlimit(10**9)
ans = 1
now = n
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else : return power(x, y//2)**2 * x % mod
ans = power(2... | n,a,b = list(map(int,input().split()))
mod = 10**9+7
ans = pow(2,n,mod)-1
inv_t = [0]+[1]
for i in range(2,b+1):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
nCk = [1]*(b+1)
for i in range(1,b+1):
nCk[i]=(((nCk[i-1]*(n-i+1))%mod)*inv_t[i])%mod
ans -= nCk[a]+nCk[b]
print((ans%mod)) | p02768 |
def d_bouquet(MOD=10**9 + 7):
N, A, B = [int(i) for i in input().split()]
from operator import mul
from functools import reduce
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
... | from functools import reduce
def d_bouquet(MOD=10**9 + 7):
from functools import reduce
N, A, B = [int(i) for i in input().split()]
def comb(m, r):
numerator = reduce(lambda x, y: x * y % MOD, list(range(m, m - r, -1)))
denominator = reduce(lambda x, y: x * y % MOD, list(range(1, r + ... | p02768 |
n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
if n == 2:
print((0))
exit()
S = pow(2, n, mod) -1
x1 = 1
y1 = 1
for i in range(a):
x1 = x1 * (n-i) % mod
y1 = y1 * (i+1) % mod
A = (x1 * pow(y1, mod - 2, mod)) % mod
x2 = 1
y2 = 1
for i in range(b):
x2 =... | n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
if n == 2:
print((0))
exit()
S = pow(2, n, mod) - 1
x1 = 1
y1 = 1
for i in range(a):
x1 = x1 * (n-i) % mod
y1 = y1 * (i+1) % mod
A = (x1 * pow(y1, mod - 2, mod)) % mod
for i in range(a, b):
x1 = x1 * (n-i) %... | p02768 |
n, a, b = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def power_func(a, n, mod):
bi = bin(n)[2:]
res = 1
for i in range(len(bi)):
res = (res * res) % mod
if bi[i] == "1":
res = (res * a) % mod
return res
def modinv(a, mod):
return pow(a, mod-2, mod)
def combination(n, r... | n, a, b = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def comb(n,r, mod):
res = 1
fac = 1
for i in range(r):
res *= n-i
res %= mod
fac *= i+1
fac %= mod
return res * pow(fac, mod-2, mod) % mod
def main():
ans = pow(2, n, MOD) - 1
ans -= comb... | p02768 |
n, a, b = list(map(int, input().split()))
mod = int(1e+9) + 7
def extgcd(a, b):
if b == 0:
return 1, 0
else:
x, y, u, v, k, l = 1, 0, 0, 1, a, b
while l != 0:
x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
k, l = l, k % l
return x
def inved(x):
a = extgcd(x, mod)
... | n, a, b = list(map(int, input().split()))
mod = int(1e+9) + 7
def extgcd(a, b):
if b == 0:
return 1, 0
else:
x, y, u, v, k, l = 1, 0, 0, 1, a, b
while l != 0:
x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
k, l = l, k % l
return x
def inved(x):
a = extgcd(x, mod)
... | p02768 |
n, a, b = list(map(int, input().split()))
p = 10**9+7
def comb(n, a):
ans = 1
for i in range(1, a + 1):
ans = ans * (n - i + 1) * pow(i, p - 2, p) % p
return ans
ans = (pow(2, n, p)-1-comb(n, a)-comb(n, b)) % p
print(ans)
| class Comb0():
# あらかじめO(k)の前計算をしておいてr<=kに対してnCrを高速に計算する
def __init__(self, n, k=10**6, p=10**9+7):
# num[i]=nPi
# den[i]=(i!)^(-1)
num, den = [1], [1]
a, b = 1, 1
for i in range(1, k+1):
a = (a*(n-i+1)) % p
b = (b*pow(i, p-2, p)) % p
... | p02768 |
from itertools import product
def check_odd(i, j):
return (i + j) % 2 == 0
def check_even(i, j):
return i % 2 == 0
def solve(n, d1, d2):
s1, s2 = 0, 0
while d1 % 4 == 0:
d1 >>= 2
s1 += 1
while d2 % 4 == 0:
d2 >>= 2
s2 += 1
f1 = check_odd... | def check_odd(i, j):
return (i + j) % 2 == 0
def check_even(i, j):
return i % 2 == 0
def solve(n, d1, d2):
s1, s2 = 0, 0
while d1 % 4 == 0:
d1 >>= 2
s1 += 1
while d2 % 4 == 0:
d2 >>= 2
s2 += 1
f1 = check_odd if d1 % 2 else check_even
f2 ... | p03334 |
from collections import deque
n=int(eval(input()))
alpha=['a','b','c','d','e','f','g','h','i','j','k']
q=deque(['a'])
for i in range(n-1):
qi_ans=[]
while(len(q)>0):
qi=q.popleft()
qiword_maxind=0
for j in range(len(qi)):
qi_ans.append(qi+qi[j])
q... | from collections import deque
n=int(eval(input()))
alpha=list('abcdefghijk')
q=deque([])
q.append(alpha[0])
for i in range(1,n):
qi=deque([])
while(len(q)>0):
qij=q.popleft()
qij_setnum=len(set(list(qij)))
for j in range(qij_setnum+1):
qi.append(qij+alpha[j... | p02744 |
n = int(input())
r = 'a',
for _ in range(n - 1):
r = [s + c for s in r for i, c in enumerate(s + chr(ord(max(s)) + 1)) if c not in s[:i]]
print(*r, sep='\n')
| n = int(input())
r = 'a',
for _ in range(n - 1):
r = [s + c for s in r for c in set(s + chr(ord(max(s)) + 1))]
print(*sorted(r), sep='\n')
| p02744 |
from itertools import groupby
n = int(input())
r = 'a',
for _ in range(n - 1):
r = [s + c for s in r for c, _ in groupby(sorted(s) + [chr(ord(max(s)) + 1)])]
print(*r, sep='\n')
| n = int(input())
r = 'a',
for _ in range(n - 1):
r = [s + c for s in r for c in set(s + chr(ord(max(s)) + 1))]
print(*sorted(r), sep='\n')
| p02744 |
from collections import *
def dfs(now):
if len(now)==N:
print((''.join(now)))
return
for i in range(ord(max(now))-ord('a')+2):
now.append(alpha[i])
dfs(now)
now.pop()
N = int(eval(input()))
alpha = 'abcdefghijklmnopqrstuvwxyz'
dfs(deque(['a'])) | from collections import *
def dfs(l):
if len(l)==N:
print((''.join(l)))
return
for a in range(ord('a'), ord(max(l))+2):
l.append(chr(a))
dfs(l)
l.pop()
N = int(eval(input()))
dfs(deque(['a'])) | p02744 |
from collections import *
def dfs(l):
if len(l)==N:
print((''.join(l)))
return
for a in range(ord('a'), ord(max(l))+2):
l.append(chr(a))
dfs(l)
l.pop()
N = int(eval(input()))
dfs(deque(['a'])) | from collections import *
def dfs(q):
if len(q)==N:
print((''.join(q)))
return
M = 'a'
for qi in q:
M = max(M, qi)
for i in range(ord(M)-ord('a')+2):
q.append(alpha[i])
dfs(q)
q.pop()
N = int(eval(input()))
alpha = '... | p02744 |
N = int(eval(input()))
def dfs(x):
if len(x) == N:
s = "".join(chr(v + ord("a")) for v in x)
print(s)
return
val = max(x)
for i in range(val + 2):
x.append(i)
dfs(x)
x.pop()
dfs([0])
|
N = int(eval(input()))
def func(x):
if len(x) == N:
print(("".join(x)))
return
last = ord(max(x)) - ord("a") + 1 if x else 0
for i in range(min(26, last) + 1):
x.append(chr(ord("a") + i))
func(x)
x.pop()
func([])
| p02744 |
import math
def div_with_mod(x, y, mod):
# Fermat's little theorem
return x*pow(y, mod - 2, mod)
def comb(n, r, mod):
# calculates C(n,r) with mod (assuming mod is prime)
nc = n
for rc in range(1, r):
nc -= 1
n = n*nc % mod
r = r*rc % mod
return div_w... | def solve():
N = int(input())
# ord("a") Unicode コードポイントを返す
codepoint = ord("a")
# たどるグラフの深さ
i = 1
# 標準形文字列とその次の辞書順
ans = [["a", 1]]
# 一つづつ潜る
while i < N:
# 次の深さをtmpとする
tmp = []
# 各ノード
for w, j in ans:
# 辞書順で追加していく
... | p02744 |
from itertools import permutations
N = int(eval(input()))
ans = []
for p in permutations(list(range(N))):
D = [-1] * N
A = []
for i in range(N):
for j in range(N):
if D[j] < p[i]:
D[j] = p[i]
A.append(j)
break
ans.append... | N = int(eval(input()))
def f(s):
if len(s) == N:
print(s)
return
for i in range(97, ord(max(list(s)))+1+1):
ns = s + chr(i)
f(ns)
f('a') | p02744 |
from itertools import product
N = int(input())
X = [chr(ord('a') + i) for i in range(N)]
first_presence = {x: i for x, i in zip(X, list(range(N)))}
ans = ['a']
R = ['a']
# 何文字目以降を変更するか
for i in range(1, N):
nr = []
for r in R:
mr = max(r)
for x in X:
nr.append(r + x)
... | N = int(input())
X = [chr(ord('a') + i) for i in range(N)]
first_presence = {x: i for x, i in zip(X, list(range(N)))}
R = ['a']
for i in range(1, N):
next_r = []
for r in R:
max_s = max(r)
for x in X[:first_presence[max_s] + 2]:
next_r.append(r + x)
R = next_r
ans ... | p02744 |
# D - String Equivalence
from string import ascii_lowercase
def dfs(n: int) -> list:
if n == 1:
return ["a"]
cur = dfs(n - 1)
result = []
for s in cur:
for c in ascii_lowercase[: len(set(s)) + 1]:
result.append(s + c)
return result
def main():
N = ... | # D - String Equivalence
abc = "abcdefghij"
def dfs(n: int) -> list:
if n == 1:
return ["a"]
cur = dfs(n - 1)
result = []
for s in cur:
for c in abc[: len(set(s)) + 1]:
result.append(s + c)
return result
def main():
N = int(eval(input()))
resu... | p02744 |
from itertools import product
N = int(eval(input()))
added = set()
ans = []
a = [[chr(97+i) for i in range(j)] for j in range(1,N+1)]
for x in product(*a):
appeared = set('a')
d = ['a']
temp = [0]
for y in x[1:]:
if y not in appeared:
appeared.add(y)
d.appen... | def dfs(s,n):
if len(s) == n:
print(s)
else:
for i in range(len(set(s))+1):
dfs(''.join([s,chr(97+i)]),n)
N = int(eval(input()))
dfs('a',N) | p02744 |
import copy
def make(n, data):
out = []
# print(ord(data[-1]) + 1 - ord("a"))
key = data[1]
for i in range(key + 1):
# print(key)
out.append([data[0] + chr(ord("a") + i), max(key, i + 1)])
return out
n = int(eval(input()))
ans = [["a", 1]]
for i in range(1, n):
tmp ... | def solve(n, s, mx):
# print(n, s, mx)
if n == 0:
print(s)
else:
for i in range(mx):
solve(n - 1, s + chr(ord("a") + i), max(mx, i + 2))
n = int(eval(input()))
solve(n - 1, 'a', 2) | p02744 |
def dfs(a='', b=chr(ord('a'))):
if len(a) == N:
print(a)
else:
i = chr(ord('a'))
while i < b:
dfs(a + i, b)
i = chr(ord(i) + 1)
dfs(a + b, chr(ord(b) + 1))
N = int(eval(input()))
dfs() | def dfs(a='', b='a'):
if len(a) == N:
print(a)
else:
i = 'a'
while i < b:
dfs(a + i, b)
i = chr(ord(i) + 1)
dfs(a + b, chr(ord(b) + 1))
N = int(eval(input()))
dfs() | p02744 |
import itertools
import bisect
def main():
N = int(eval(input()))
letterset = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
check = []
for i in range(1, N+1):
iters = itertools.product(letterset[:i], repeat=N)
for tmp in iters:
if len(set(tmp)) == i:
... | import sys
sys.setrecursionlimit(10**7)
strlist = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
def dfs(n, before):
lensetbefore = len(set(before))
if n == 1:
print(before)
if n > 1:
for s in strlist[:lensetbefore+1]:
dfs(n-1, before+s)
def main():
N = i... | p02744 |
n=int(input())-1
l=[[] for _ in range(10)]
l[0].append('a')
for i in range(n):
for w in l[i]:
s = sorted(set(w))
for c in s:
l[i+1].append(w+c)
l[i+1].append(w+chr(ord(s[-1])+1))
print(*l[n],sep='\n')
| a='a'
for _ in range(int(input())-1):
a=[s+c for s in a for c in sorted(set(s+chr(ord(max(s))+1)))]
print(*a,sep='\n')
| p02744 |
N = int(input())
s = set()
def solve(n):
global s
if n == N:
return
if len(s) == 0:
s.add('a')
solve(n+1)
else:
new_s = set()
for v in s:
xc = chr(ord(max(v))+1)
for vc in v:
new_s.add(v + vc)
... | N = int(input())
s = {'a'}
def solve(n):
global s
if n == N:
return
new_s = set()
for v in s:
xc = chr(ord(max(v))+1)
for vc in v:
new_s.add(v + vc)
new_s.add(v + xc)
s = new_s
solve(n+1)
solve(1)
ans = sorted(s)
print(*ans, s... | p02744 |
n = int(eval(input()))
L = [0]*n
for i in range(n):
L[i] = chr(i+ord('a'))
#print(L)_
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for v in L[0:len(set(A))+1]:
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len... | n = int(eval(input()))
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for i in range(len(set(A))+1):
v = chr(i+ord('a'))
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len(ans)):
print((ans[i]))
| p02744 |
def cur(n):
if ans[n]!=[]: return ans[n]
for x in cur(n-1):
tmp1=[0]+[x[i] for i in range(n-1)]
tmp2=[0]+[x[i]+1 for i in range(n-1)]
ans[n].append(tmp1)
ans[n].append(tmp2)
if max(x)!=0:
for k in range(1,max(x)+1):
tmp3=[0]+[x[i] for ... | n=int(eval(input()))
def cur(x):
if len(x)==n:
s="".join([chr( ord("a")+x[i]) for i in range(n)])
print(s)
else:
for i in range(max(x)+2):
cur(x+[i])
cur([0]) | p02744 |
from collections import deque
N = int(eval(input()))
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
unvisited = deque(alphabet[0 : N])
visited = deque()
st = deque([["a", visited, unvisited]]) # stack
while len(st) > 0:
str, visited, unvisited = st.popleft()
if str[-1] not in visite... | from collections import deque
N = int(eval(input()))
alphabet = "abcdefghij"
visited = 1
st = deque([["a", visited]])
while len(st) > 0:
str, visited = st.popleft()
if len(str) == N:
print(str)
else:
# すでに使った文字を使う
for x in alphabet[0 : visited]:
st.appen... | p02744 |
from collections import deque
N = int(eval(input()))
alphabet = "abcdefghij"
visited = 1
st = deque([["a", visited]])
while len(st) > 0:
str, visited = st.popleft()
if len(str) == N:
print(str)
else:
# すでに使った文字を使う
for x in alphabet[0 : visited]:
st.appen... | from collections import deque
N = int(eval(input()))
alphabet = "abcdefghij"
visited = 1
st = deque([("a", visited)])
while len(st) > 0:
str, visited = st.popleft()
if len(str) == N:
print(str)
else:
# すでに使った文字を使う
for x in alphabet[0 : visited]:
st.appen... | p02744 |
N = int(eval(input()))
def DFS(N, S):
if len(S) == N:
print(S)
else:
next_chrs = []
if S:
next_max_chr = ord(max(S)) + 1
else:
next_max_chr = ord("a")
for i in range(0, next_max_chr - ord("a") + 1):
DFS(N, "".join([S, chr... | N = int(eval(input()))
def DFS(N, S):
if len(S) == N:
print(S)
else:
if S:
next_max_chr = ord(max(S)) + 1
else:
next_max_chr = ord("a")
for i in range(0, next_max_chr - ord("a") + 1):
DFS(N, S + chr(ord("a") + i))
DFS(N, "") | p02744 |
def dfs(n):
adj = [chr(i+97) for i in range(26)]
stack = ['a']
while stack:
node = stack.pop(0)
if len(node) == n:
print(node)
else:
limit = ord(max(node))%97+2
for child in adj[:limit]:
stack.append(node+child)
... | def dfs(s,n,adj):
adj = 'abcdefghij'
if len(s) == n:
print(s)
else:
for child in adj[:len(set(s))+1]:
dfs(s+child,n,adj)
return -1
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(eval(input()))
adj = 'abcdefghij'
... | p02744 |
N = int(eval(input()))
import itertools
from collections import deque
ans = deque()
l = []
r = deque()
for i in range(N):
l.append(chr(97+i))
r.append(l.copy())
p = [[] for _ in range(N)]
p[0].append('a')
for i in range(1,N):
for j in r[i]:
for k in p[i-1]:
p[i].append(k+j)
p ... | N = int(eval(input()))
from collections import deque
import itertools
ans = deque()
l = []
r = deque()
for i in range(N):
l.append(chr(97+i))
r.append(l.copy())
p = [[[] for _ in range(N)] for _ in range(N)]
p[0][0].append('a')
for i in range(1,N):
for j in r[i]:
x = ord(j)-97
for n,k ... | p02744 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.