input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = []
C = []
for i in range(Q):
b, c = list(map(int, input().split()))
B.append(b)
C.append(c)
A_new = {}
for a in A:
if not a in A_new:
A_new[a] = 1
else:
A_new[a] += 1
for i in range(Q):
b = B[i]
c = C[i]
if b in A_new:
n = A_new[b]
A_new[b] = 0
if c in A_new:
A_new[c] += n
else:
A_new[c] = n
key_list = list(A_new.keys())
res = 0
for k in key_list:
res += A_new[k] * k
print(res)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = []
C = []
for i in range(Q):
b, c = list(map(int, input().split()))
B.append(b)
C.append(c)
A_new = {}
for a in A:
if not a in A_new:
A_new[a] = 1
else:
A_new[a] += 1
sum = 0
for i in range(0, 1):
b = B[i]
c = C[i]
if b in A_new:
n = A_new[b]
A_new[b] = 0
if c in A_new:
A_new[c] += n
else:
A_new[c] = n
key_list = list(A_new.keys())
res = 0
for k in key_list:
res += A_new[k] * k
print(res)
sum = res
for i in range(1, Q):
b = B[i]
c = C[i]
dif = 0
if b in A_new:
n = A_new[b]
A_new[b] = 0
if c in A_new:
A_new[c] += n
else:
A_new[c] = n
dif = c * n - b * n
sum += dif
print(sum)
| p02630 |
from collections import defaultdict
N = int(eval(input()))
nums = list(map(int,input().split()))
Q = int(eval(input()))
dct = defaultdict(int)
for _ in range(N):
dct[nums.pop()] += 1
for _ in range(Q):
B, C = list(map(int,input().split()))
if B in dct:
if C in dct:
dct[C] += dct.pop(B)
else:
dct[C] = dct.pop(B)
sum = 0
for k, v in list(dct.items()):
sum += k * v
print(sum)
| from collections import defaultdict
N = int(eval(input()))
nums = list(map(int,input().split()))
Q = int(eval(input()))
res = 0
dct = defaultdict(int)
for _ in range(N):
n = nums.pop()
dct[n] += 1
res += n
for _ in range(Q):
B, C = list(map(int,input().split()))
if B in dct:
n = dct.pop(B)
res += (C - B) * n
if C in dct:
dct[C] += n
else:
dct[C] = n
print(res)
| p02630 |
import collections
def A_sum(A):
s = 0
for i in list(A.items()):
s+=i[0]*i[1]
print(s)
def A_rep(A,f,t):
f_num = A.get(f)
if f_num != None:
A[t]=A.get(t,0) + f_num
A.pop(f)
N = int(eval(input()))
A = collections.Counter(list(map(int,input().split())))
Q = int(eval(input()))
for i in range(Q):
b,c = list(map(int,input().split()))
A_rep(A,b,c)
A_sum(A)
| import collections
def A_sum(A):
s = 0
for i in list(A.items()):
s+=i[0]*i[1]
return s
def A_rep(A,f,t):
f_num = A.get(f)
if f_num != None:
A[t]=A.get(t,0) + f_num
diff = f_num*(t-f)
A.pop(f)
return diff
return 0
N = int(eval(input()))
A = collections.Counter(list(map(int,input().split())))
Q = int(eval(input()))
ans = A_sum(A)
for i in range(Q):
b,c = list(map(int,input().split()))
diff = A_rep(A,b,c)
if diff !=0:
ans+=diff
print(ans)
| p02630 |
import sys
import collections
ri = lambda: int(sys.stdin.readline())
rl = lambda: list(map(int, sys.stdin.readline().split()))
n = ri()
a = rl()
il = list(set(a))
li = collections.Counter(a)
q = ri()
res = []
bc = [rl() for _ in range(q)]
for vvv in bc:
b, c = vvv
if b in il:
if c in il:
li[c] += li[b]
else:
li[c] = li[b]
il.append(c)
li[b] = 0
il.remove(b)
ans = 0
for k, v in list(li.items()):
ans += k*v
res.append(ans)
for aaa in res:
print(aaa)
| import sys
ri = lambda: int(sys.stdin.readline())
rm = lambda: list(map(int, sys.stdin.readline().split()))
rl = lambda: list(map(int, sys.stdin.readline().split()))
n = ri()
a = rl()
t = sum(a)
cnt_li = [0]*10**5
for i in a:
cnt_li[i-1] += 1
for _ in range(ri()):
b, c = rm()
t += (c-b)*cnt_li[b-1]
print(t)
cnt_li[c-1] += cnt_li[b-1]
cnt_li[b-1] = 0 | p02630 |
n = int(eval(input()))
A = tuple(map(int, input().split()))
Q = int(eval(input()))
Bs = [tuple(tuple(map(int, input().split()))) for i in range(Q)]
X = [0]
for i in range(1, 100001):
X.append(A.count(i))
S = sum(A)
for B in Bs:
S += X[B[0]]*(B[1]-B[0])
X[B[1]] += X[B[0]]
X[B[0]] = 0
print(S) | n = int(eval(input()))
A = list(map(int, input().split()))
S = sum(A)
D = {c:0 for c in range(1, 10**5+1)}
for a in A:
D[a] += 1
for _ in range(int(eval(input()))):
B, C = list(map(int, input().split()))
S += (C-B)*D[B]
D[C] += D[B]
D[B] = 0
print(S) | p02630 |
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
A.sort()
B = list(set(A))
X = [[0 for j in range(2)] for i in range(len(B))]
for i in range(len(B)):
b=bisect.bisect_left(A,B[i])
c=bisect.bisect_right(A,B[i])
num = c - b #B[i]の要素数
X[i][0] = B[i]
X[i][1] = num
M = [0 for j in range(Q)]
N = [0 for j in range(Q)]
for i in range(Q):
M[i],N[i] = list(map(int,input().split()))
ans = int()
for i in range(Q):
x = M[i]
y = N[i]
ans = 0
for j in range(len(B)):
if X[j][0] == x:
X[j][0] = y
ans += X[j][0] * X[j][1]
print(ans)
#print(X)
| N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
BC = [list(map(int,input().split())) for i in range(Q)]
B, C = [list(i) for i in zip(*BC)]
#print(B,C,BC)
dic = {}
for a in A:
dic[a] = dic.get(a,0) + 1
#print(dic)
ans = sum(A)
for q in range(Q):
ans = ans + (C[q]-B[q]) * dic.get(B[q],0)
dic[C[q]] = dic.get(B[q],0) + dic.get(C[q],0)
dic[B[q]] = 0
print(ans)
| p02630 |
n = int(eval(input()))
a = list(map(str, input().split()))
q = int(eval(input()))
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(str, input().split()))
tmp = ','.join(a)
for i in range(q):
tmp = tmp.replace(b[i], c[i])
ans = list(tmp.split(','))
ans2 = 0
for j in ans:
ans2 += int(j)
print(ans2) | n = int(eval(input()))
a = list(map(str, input().split()))
q = int(eval(input()))
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(str, input().split()))
tmp = ','.join(a)
for i in range(q):
tmp = tmp.replace(b[i], c[i])
ans = list(map(int, tmp.split(',')))
print((sum(ans))) | p02630 |
import sys
def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())
import re
def solver(N,A,Q,BC):
for b,c in BC:
#print(A,':',b,'->',c)
bef = '[\s]*'+str(b)
aft = ' '+str(c)
#print("bef,aft=",bef,aft)
A = re.sub(bef, aft, A)
#A = A.replace(' '+str(b), ' '+str(c))
#print(A)
print((sum(map(int,A.split()))))
def main():
N = I()
#A = LI()
A = L()
Q = I()
BC = []*Q
BC = [LI() for _ in range(Q)]
#print("N,Q=",N,Q)
#print("A=",A)
#print("BC=",BC)
solver(N,A,Q,BC)
if __name__ == '__main__':
main()
| import sys
def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())
import collections
def solver(N,A,Q,BC):
T = sum(map(int,A))
#print(T)
Nums = collections.Counter(A)
#print(Nums)
for b,c in BC:
diff = c - b
T += Nums[b] * diff
print(T)
Nums[c] += Nums[b]
Nums[b] = 0
def main():
N = I()
A = LI()
Q = I()
BC = []*Q
BC = [LI() for _ in range(Q)]
solver(N,A,Q,BC)
if __name__ == '__main__':
main()
| p02630 |
n = int(eval(input()))+1
a = list(map(int, input().split()))
cnt = []
sum = 0
for i in range(100005):
cnt.append(a.count(i))
sum += i * cnt[i]
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
sum += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(sum)
| n = int(eval(input()))+1
a = list(map(int, input().split()))
cnt = []
for i in range(100005):
cnt.append(0)
sum = 0
for i in a:
cnt[i] += 1
for i in range(100005):
sum += i * cnt[i]
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
sum += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(sum)
| p02630 |
n = int(eval(input()))+1
a = list(map(int, input().split()))
cnt = []
for i in range(100005):
cnt.append(0)
sum = 0
for i in a:
cnt[i] += 1
for i in range(100005):
sum += i * cnt[i]
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
sum += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(sum)
| n = int(eval(input()))+1
a = list(map(int, input().split()))
cnt = []
for i in range(100005):
cnt.append(0)
sum = 0
# a.count(i)を使うとTLE
# count()がO(N)のためfor内で使用するとO(N2)になる？
for i in a:
cnt[i] += 1
for i in range(100005):
sum += i * cnt[i]
q = int(eval(input()))
ans = []
for i in range(q):
b, c = list(map(int, input().split()))
sum += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
ans.append(sum)
for i in ans:
print(i) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
data = [0] * 100001
def my_sum(d):
retval = 0
for i in range(len(d)):
if d[i] == 0:
continue
retval += d[i] * i
return retval
for i in A:
data[i] += 1
for i in range(Q):
B, C = list(map(int, input().split()))
if data[B] != 0:
data[C] += data[B]
data[B] = 0
print((my_sum(data))) | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
data = [0] * 100001
def my_sum(d):
retval = 0
for i in range(len(d)):
if d[i] == 0:
continue
retval += d[i] * i
return retval
for i in A:
data[i] += 1
sum_val = my_sum(data)
for i in range(Q):
B, C = list(map(int,input().split()))
sum_val = sum_val - (data[B] * B) + (data[B] * C)
data[C] += data[B]
data[B] = 0
print(sum_val)
| p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
x = 0
count = Counter(a)
q = int(eval(input()))
b,c = [],[]
for i in range(q):
bi,ci = list(map(int,input().split()))
b.append(bi),c.append(ci)
for i in range(q):
bi,ci = b[i],c[i]
count[ci]+=count[bi]
count[bi] = 0
x = 0
for k,v in list(count.items()):
x+=k*v
print(x)
| from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
x = sum(a)
count = Counter(a)
q = int(eval(input()))
b,c = [],[]
for i in range(q):
bi,ci = list(map(int,input().split()))
b.append(bi),c.append(ci)
for i in range(q):
bi,ci = b[i],c[i]
x -= bi*count[bi]
x += ci*count[bi]
count[ci]+=count[bi]
count[bi] = 0
print(x) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
D = {}
for i in A:
if i in D:
D[i] += 1
else:
D[i] = 1
for i in range(Q):
s = 0
bi, ci = list(map(int, input().split()))
if bi in D:
if ci in D:
D[ci] += D[bi]
else:
D[ci] = D[bi]
del D[bi]
for j in D:
s += j * D[j]
print(s) | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
D = {}
for i in A:
if i in D:
D[i] += 1
else:
D[i] = 1
s = 0
for j in D:
s += j * D[j]
for i in range(Q):
bi, ci = list(map(int, input().split()))
if bi in D:
if ci in D:
D[ci] += D[bi]
else:
D[ci] = D[bi]
s += (ci - bi) * D[bi]
del D[bi]
print(s) | p02630 |
n=int(eval(input()))
member = [0]*(10**5+1)
li = list(map(int,input().split()))
for i in range(n):
member[li[i]] +=1
q = int(eval(input()))
for j in range(q):
x,y = input().split()
x=int(x)
y=int(y)
member[y]+=member[x]
member[x]=0
total = 0
for k in range(10**5+1):
total += k*member[k]
print(total) | n=int(eval(input()))
member = [0]*(10**5+1)
li = list(map(int,input().split()))
total = sum(li)
for i in range(n):
member[li[i]] +=1
q = int(eval(input()))
for j in range(q):
x,y = input().split()
x=int(x)
y=int(y)
total += (y-x)*member[x]
print(total)
member[y]+=member[x]
member[x]=0 | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
counter = Counter(A)
for i in range(Q):
b, c = list(map(int, input().split()))
count_b = counter[b]
counter[b]-= count_b
counter[c] += count_b
print((sum([k*v for k, v in list(counter.items())]))) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
counter = Counter(A)
ans = sum(A)
for i in range(Q):
b, c = list(map(int, input().split()))
count_b = counter[b]
counter[b] -= count_b
counter[c] += count_b
ans = ans - b*count_b + c*count_b
print(ans) | p02630 |
def solve():
n=int(eval(input()))
r=range
a=list(map(int, input().split()))
q=int(eval(input()))
for _ in r(q):
bi, ci = list(map(int, input().split()))
c=0
for i in r(n):
if a[i] == bi:
a[i]=ci
c+=a[i]
print(c)
if __name__ == '__main__':
t=1
for _ in range(t):
solve()
| def solve():
n=int(eval(input()))
r=range
a=list(map(int, input().split()))
q=int(eval(input()))
d={}
s=0
for i in r(n):
cu=a[i]
if d.get(cu, None):
d[cu]+=1
else:
d[cu]=1
s+=cu
for _ in r(q):
bi, ci = list(map(int, input().split()))
diff=ci-bi
if d.get(ci, None):
d[ci]+=d.get(bi, 0)
else:
d[ci]=d.get(bi, 0)
s+=diff * d.get(bi, 0)
print(s)
if d.get(bi, None):
d[bi]=0
if __name__ == '__main__':
t=1
for _ in range(t):
solve()
| p02630 |
N = int(eval(input()))
lsn = list(map(int,input().split()))
Q = int(eval(input()))
ls2 = []
for i in range(Q):
Bi,Ci = list(map(int,input().split()))
ls2.append([Bi,Ci])
index = [0]*(10**5+1)
for i in range(10**5+1):
index[i] = lsn.count(i)
sum1 = sum(lsn)
for l in ls2:
sum1 = sum1 +(l[1]-l[0])*index[l[0]]
index[l[1]] += index[l[0]]
index[l[0]] = 0
print(sum1) | import collections
N = int(eval(input()))
lsn = list(map(int,input().split()))
Q = int(eval(input()))
ls2 = []
for i in range(Q):
Bi,Ci = list(map(int,input().split()))
ls2.append([Bi,Ci])
index = collections.Counter(lsn)
sum1 = sum(lsn)
for l in ls2:
sum1 = sum1 +(l[1]-l[0])*index[l[0]]
index[l[1]] += index[l[0]]
index[l[0]] = 0
print(sum1) | p02630 |
import sys
from collections import Counter
input = sys.stdin.readline
def S():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def print_sum(d):
s = 0
for k, v in list(d.items()):
s += k * v
print(s)
n = I()
al = list(MI())
q = I()
a = Counter(al)
for i in range(q):
b, c = MI()
if b in list(a.keys()):
v = a.pop(b)
if c in list(a.keys()):
a[c] += v
else:
a[c] = v
print_sum(a)
| import sys
from collections import Counter
input = sys.stdin.readline
def S():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
n = I()
al = list(MI())
q = I()
a = Counter(al)
s = sum(al)
for _ in range(q):
b, c = MI()
if b in list(a.keys()):
v = a.pop(b)
if c in list(a.keys()):
a[c] += v
else:
a[c] = v
s += (c - b) * v
print(s)
| p02630 |
import collections
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
BC = [list(map(int,input().split())) for _ in range(Q)]
ans = sum(A)
for i in range(Q):
A = [BC[i][1] if x==BC[i][0] else x for x in A]
print((sum(A))) | import collections
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
BC = [list(map(int,input().split())) for _ in range(Q)]
ans = sum(A)
d = collections.defaultdict(int)
for key in A:
d[key] += 1
for i in range(Q):
b,c = BC[i][0],BC[i][1]
ans += d[b]*(c-b)
d[c] += d[b]
d[b] = 0
print(ans) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dic = {a+1:0 for a in range(10**5)}
for a in A:
dic[a] += 1
for i in range(Q):
B, C = list(map(int, input().split()))
dic[C] += dic[B]
dic[B] = 0
ans = 0
for k, v in list(dic.items()):
ans += k*v
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
ans = sum(A)
dic = {a+1:0 for a in range(10**5)}
for a in A:
dic[a] += 1
for i in range(Q):
B, C = list(map(int, input().split()))
ans += dic[B]*(C-B)
dic[C] += dic[B]
dic[B] = 0
print(ans)
| p02630 |
from collections import Counter
import copy
N = int(eval(input()))
target_list = list(map(int, input().split()))
check = [Counter(target_list)]
result_list = [sum(target_list)]
for index in range(int(eval(input()))):
B, C = list(map(int, input().split()))
if B in check[index]:
result = copy.deepcopy(check[index])
change = result.pop(B)
diff = change * (C - B)
if C in result:
result[C] = result[C] + change
else:
result[C] = change
else:
result = copy.deepcopy(check[index])
diff = 0
check.append(result)
print((result_list[index] + diff))
result_list.append(result_list[index] + diff)
| from collections import Counter
N = int(eval(input()))
target_list = list(map(int, input().split()))
check = Counter(target_list)
result = sum(target_list)
for index in range(int(eval(input()))):
B, C = list(map(int, input().split()))
if B in check:
result = result + (check[B]) * (C - B)
if C in check:
check[C] = check[C] + check[B]
else:
check[C] = check[B]
check[B] = 0
print(result)
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
d = dict()
for i in range(n):
if a[i] not in list(d.keys()):
d[a[i]] = 1
else:
d[a[i]] += 1
for i in range(q):
b, c = list(map(int, input().split()))
if b in list(d.keys()):
if c in list(d.keys()):
d[c] += d[b]
del d[b]
else:
d[c] = d[b]
del d[b]
print((sum([k * v for k, v in list(d.items())]))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
d = dict()
for i in range(n):
if a[i] not in list(d.keys()):
d[a[i]] = 1
else:
d[a[i]] += 1
s = sum([k * v for k, v in list(d.items())])
for i in range(q):
b, c = list(map(int, input().split()))
if b in list(d.keys()):
s += (c - b) * d[b]
if c in list(d.keys()):
d[c] += d[b]
d[b] = 0
else:
d[c] = d[b]
d[b] = 0
print(s) | p02630 |
# -*- coding: utf-8 -*-
n=int(eval(input()))
numlista=list(map(int,input().split()))
#aの合計を求める(suma)
suma=0
for i in range(n):
suma+=numlista[i]
#1~10000がそれぞれいくつあるのか調べる(numkosuu)
numkosuu=[]
for i in range(100000):
numkosuu.append(numlista.count(i+1))
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
#変化したところのみ計算する
suma+=(c-b)*numkosuu[b-1]
#個数を更新する
numkosuu[c-1]+=numkosuu[b-1]
numkosuu[b-1]=0
print(suma) | # -*- coding: utf-8 -*-
n=int(eval(input()))
numlista=list(map(int,input().split()))
import collections
numkosuu=collections.Counter(numlista)
suma=0
for i in numlista:
suma+=i
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
#変化したところのみ計算する
suma+=(c-b)*numkosuu[b]
#個数を更新する
numkosuu[c]+=numkosuu[b]
numkosuu[b]=0
print(suma) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
bc=[tuple(map(int,input().split())) for _ in range(q)]
d={}
for ai in a:
if ai not in d:
d[ai]=0
d[ai]+=1
# print(d)
for bi,ci in bc:
if bi in d:
tmp=d[bi]
d[bi]=0
if ci not in d:
d[ci]=0
d[ci]+=tmp
ans=0
for key in d:
ans+=key*d[key]
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
bc=[tuple(map(int,input().split())) for _ in range(q)]
d={}
for ai in a:
if ai not in d:
d[ai]=0
d[ai]+=1
# print(d)
ans=0
for key in d:
ans+=key*d[key]
for bi,ci in bc:
if bi in d:
tmp=d[bi]
d[bi]=0
ans-=bi*tmp
if ci not in d:
d[ci]=0
d[ci]+=tmp
ans+=ci*tmp
print(ans)
| p02630 |
import collections
n = int(eval(input()))
l = list(map(int, input().split()))
a = int(eval(input()))
c = collections.Counter(l)
for i in range(a):
j,k = list(map(int, input().split()))
save = c[j]
del c[j]
c[k] += save
answer = 0
for q,r in list(c.items()):
answer += int(q)*int(r)
print(answer)
| import collections
n = int(eval(input()))
l = list(map(int, input().split()))
a = int(eval(input()))
c = collections.Counter(l)
answer = sum(l)
for i in range(a):
j,k = list(map(int, input().split()))
save = c[j]
del c[j]
c[k] += save
answer = answer + k*save - j*save
print(answer)
| p02630 |
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
for i in range(Q):
X,Y = list(map(int,input().split()))
ans = 0
for j in range(N):
if A[j] == X:
ans += Y
A[j] = Y
else:
ans += A[j]
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
cnt_dict = {}
s = sum(A)
ans = 0
for item in A:
if item not in cnt_dict:
cnt_dict[item] = 0
cnt_dict[item] += 1
for _ in range(Q):
X,Y = list(map(int,input().split()))
if X not in cnt_dict:
cnt_dict[X] = 0
if Y not in cnt_dict:
cnt_dict[Y] = 0
s -= cnt_dict[X] * X
s += cnt_dict[X] * Y
cnt_dict[Y] += cnt_dict[X]
cnt_dict[X] = 0
print(s)
'''
#初期案 遅すぎ
N = int(input())
A = list(map(int,input().split()))
Q = int(input())
for i in range(Q):
X,Y = map(int,input().split())
ans = 0
for j in range(N):
if A[j] == X:
ans += Y
A[j] = Y
else:
ans += A[j]
print(ans)
'''
| p02630 |
n = int(eval(input()))
As = list(map(int, input().split()))
q = int(eval(input()))
Ds = [0] * (10 ** 5 + 1)
for a in As:
Ds[a] += 1
for i in range(q):
b, c = list(map(int, input().split()))
Ds[c] += Ds[b]
Ds[b] = 0
ans = 0
for x, i in enumerate(Ds):
ans += x * i
print(ans) | n = int(eval(input()))
As = list(map(int, input().split()))
q = int(eval(input()))
Ds = [0] * (10 ** 5 + 1)
Es = [i for i in range(10 ** 5 + 1)]
for a in As:
Ds[a] += 1
ans = sum(As)
for i in range(q):
b, c = list(map(int, input().split()))
ans += Ds[b] * (c-b)
Ds[c] += Ds[b]
Ds[b] = 0
print(ans) | p02630 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
S = sum(A)
Q = int(eval(input()))
T = collections.Counter(A)
for i in range(Q):
b, c = list(map(int, input().split()))
S += T[b]*(c-b)
T[c] += T[b]
T[b] = 0
print(S) | def main():
n, *i = list(map(int, open(0).read().split()))
a = i[:n]
_ = i[n]
s = sum(a)
m = [0] * (10 ** 5 + 1)
for x in a:
m[x] += 1
ans = []
for b, c in zip(*[iter(i[n + 1:])] * 2):
m[c] += m[b]
s += (c - b) * m[b]
m[b] = 0
ans.append(s)
print(("\n".join(map(str, ans))))
if __name__ == '__main__':
main() | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
bcs=[list(map(int,input().split())) for i in range(Q)]
total=sum(A)
c=collections.Counter(A)
ans=[0 for i in range(Q)]
for i in range(Q):
B=bcs[i][0]
C=bcs[i][1]
if c[B]!=0:
tempcounterpl=collections.Counter([C for j in range(c[B])])
total=total+c[B]*(C-B)
ans[i]=total
c[B]=0
c=c+tempcounterpl
else:
ans[i]=total
for i in range(Q):
print((ans[i])) | import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
bcs=[list(map(int,input().split())) for i in range(Q)]
total=sum(A)
c=collections.Counter(A)
ans=[0 for i in range(Q)]
for i in range(Q):
B=bcs[i][0]
C=bcs[i][1]
if c[B]!=0:
total+=c[B]*(C-B)
ans[i]=total
c[C]+=c[B]
c[B]=0
else:
ans[i]=total
for i in range(Q):
print((ans[i]))
| p02630 |
n = int(eval(input()))
numlist = list(map(int,input().split()))
numcount = [0]*10**6
numset = set()
for num in numlist:
numcount[num] += 1
numset.add(num)
n = int(eval(input()))
anslist = []
for i in range(n):
b,c = list(map(int,input().split()))
numcount[c] += numcount[b]
numcount[b] = 0
numset.add(c)
numset.discard(b)
result = 0
for num in list(numset):
result += numcount[num]*num
anslist.append(result)
for ans in anslist:
print(ans)
| n = int(eval(input()))
numlist = list(map(int,input().split()))
numcount = [0]*10**6
numset = set()
for num in numlist:
numcount[num] += 1
numset.add(num)
n = int(eval(input()))
anslist = []
result = 0
for num in list(numset):
result += numcount[num]*num
for i in range(n):
b,c = list(map(int,input().split()))
numcount[c] += numcount[b]
result += (c-b)*numcount[b]
anslist.append(result)
numcount[b] = 0
numset.add(c)
numset.discard(b)
for ans in anslist:
print(ans)
| p02630 |
import collections as c
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
s = sum(a)
cnt = c.Counter(a)
for i in range(100000):
cnt[i] = a.count(i+1)
for i in range(q):
b,c = list(map(int,input().split()))
s += (c-b)*cnt[b-1]
cnt[c-1] += cnt[b-1]
cnt[b-1] = 0
print(s) | import collections as c
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
s = sum(a)
cnt = c.Counter(a)
for i in range(q):
b,c = list(map(int,input().split()))
s += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(s) | p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(q)]
dic = Counter(a)
for i in range(q):
(b, c) = l[i]
num = dic[b]
dic[b] = 0
if dic[c] == 0:
dic[c] = num
else:
dic[c] += num
ans = 0
for i, j in list(dic.items()):
ans += i*j
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(q)]
dic = Counter(a)
S = sum(a)
for i in range(q):
(b, c) = l[i]
num = dic[b]
S -= b*num
dic[b] = 0
if dic[c] == 0:
dic[c] = num
else:
dic[c] += num
S += c*num
print(S) | p02630 |
def main():
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
ans = [None] * Q
A_Counter = Counter(A)
for q in range(Q):
B, C = list(map(int, input().split()))
A_Counter[C] += A_Counter[B]
A_Counter[B] = 0
ans[q] = sum(A_Counter.elements())
print(('\n'.join(map(str, ans))))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
def main():
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
ans = [None] * Q
Asum = sum(A)
A_Counter = Counter(A)
for q in range(Q):
B, C = list(map(int, input().split()))
Asum = Asum + (C-B)*A_Counter[B]
A_Counter[C] += A_Counter[B]
A_Counter[B] = 0
ans[q] = Asum
print(('\n'.join(map(str, ans))))
if __name__ == "__main__":
main()
| p02630 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
a=nl()
nums = [0]*10**6
for i in range(n):
nums[a[i]]+=1
q=ni()
for i in range(q):
b,c=nm()
nums[c]+=nums[b]
nums[b]=0
ans=0
for j in range(len(nums)):
ans+=nums[j]*j
print(ans)
| ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
a=nl()
nums = [0]*10**6
for i in range(n):
nums[a[i]]+=1
q=ni()
ans=0
for i in range(len(nums)):
ans+=nums[i]*i
for i in range(q):
b,c=nm()
ans-=nums[b]*b
ans+=nums[b]*c
nums[c]+=nums[b]
nums[b]=0
print(ans)
| p02630 |
N = int(eval(input()))
data = [int(i) for i in input().split()]
Q = int(eval(input()))
array = dict()
for i in data:
if i in array:
array[i] += 1
else:
array[i] = 1
for i in range(Q):
quary = [int(i) for i in input().split()]
if quary[0] not in array:
pass
elif quary[1] in array:
array[quary[1]] += array[quary[0]]
del array[quary[0]]
else:
array[quary[1]] = array[quary[0]]
del array[quary[0]]
total = 0
for i, j in list(array.items()):
total += i*j
print(total) | N = int(eval(input()))
data = [int(i) for i in input().split()]
Q = int(eval(input()))
array = dict()
for i in data:
if i in array:
array[i] += 1
else:
array[i] = 1
total = 0
for i, j in list(array.items()):
total += i*j
for i in range(Q):
dt = 0
quary = [int(i) for i in input().split()]
if quary[0] not in array:
pass
elif quary[1] in array:
dt = (quary[1]-quary[0])*array[quary[0]]
array[quary[1]] += array[quary[0]]
del array[quary[0]]
else:
dt = (quary[1]-quary[0])*array[quary[0]]
array[quary[1]] = array[quary[0]]
del array[quary[0]]
total += dt
print(total) | p02630 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
sa = sorted(a)
q = int(eval(input()))
b = []
for _ in range(q):
b.append([int(i) for i in input().split()])
for i in range(q):
idx = -1
seta = set(sa)
if b[i][0] in seta:
idx = sa.index(b[i][0])
# print(idx)
if idx != -1:
while (True):
if idx < n and sa[idx] == b[i][0]:
sa[idx] = b[i][1]
idx += 1
else:
break
# print(sa)
print((sum(sa)))
| n = int(eval(input()))
a = [int(i) for i in input().split()]
q = int(eval(input()))
b = []
for _ in range(q):
b.append([int(i) for i in input().split()])
al = {}
suma = sum(a)
for i in a:
if i not in al:
al[i] = 1
else:
al[i] += 1
for i in range(q):
if b[i][0] in al:
suma += (b[i][1] - b[i][0]) * al[b[i][0]]
if b[i][1] in al:
al[b[i][1]] += al[b[i][0]]
al[b[i][0]] = 0
else:
al[b[i][1]] = al[b[i][0]]
al[b[i][0]] = 0
print(suma)
| p02630 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10 ** 5 + 1)
for a in A:
d[a] += 1
for b, c in zip(BC[::2], BC[1::2]):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == '__main__':
main()
| import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10 ** 5 + 1)
for a in A:
d[a] += 1
for b, c in zip(*[iter(BC)] * 2):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == '__main__':
main()
| p02630 |
from collections import *
from operator import mul
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
A_dic = Counter(A)
for _ in range(q):
b, c = list(map(int, input().split()))
tmp = A_dic[b]
A_dic[c] += tmp
A_dic[b] = 0
v, c = list(zip(*A_dic.most_common()))
ans = list(map(mul, v, c))
print((sum(ans))) | from collections import *
from operator import mul
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
A_dic = Counter(A)
A_sum = sum(A)
for _ in range(q):
b, c = list(map(int, input().split()))
tmp = A_dic[b]
A_dic[c] += tmp
A_dic[b] = 0
A_sum += tmp*(c - b)
print(A_sum) | p02630 |
n = int(eval(input()))
dic = {}
for i in input().split():
if i not in dic:
dic[i] = 0
dic[i] += 1
q = int(eval(input()))
for j in range(q):
b,c = (str(x) for x in input().split())
if b not in dic:
pass
else:
if c not in dic:
dic[c] = dic[b]
dic[b] = 0
else:
dic[c] += dic[b]
dic[b] = 0
ans = 0
for k in dic:
ans += int(k)*dic[k]
print(ans)
| n = int(eval(input()))
dic = {}
list = [int(i) for i in input().split()]
for i in list:
if i not in dic:
dic[i] = 0
dic[i] += 1
q = int(eval(input()))
ans = sum(list)
for j in range(q):
b,c = (int(x) for x in input().split())
if b not in dic:
print(ans)
continue
else:
if c not in dic:
dic[c] = dic[b]
else:
dic[c] += dic[b]
ans = ans + (c-b)*dic[b]
dic[b] = 0
print(ans)
| p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
counter = Counter(a)
sum_res = sum(a) # はじめの合計、名前がsumだとsum関数とかぶってよくないので
# q回操作します。ループ変数は使わないので_とします（Pythonの慣習）
for _ in range(q):
before, after = list(map(int, input().split()))
# 合計を変更します
sum_res -= before * counter[before]
sum_res += after * counter[before]
# 個数を変更します
counter[after] += counter[before]
counter[before] = 0
print(sum_res) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
cou = Counter(a)
s = sum(a)
for b, c in bc:
s = s + cou[b]*(c-b)
cou[c] += cou[b]
cou[b] = 0
print(s) | p02630 |
n = int(eval(input()))
a = input().split()
q = int(eval(input()))
for i in range(q):
stdins = input().split()
for j in range(n):
a[j] = a[j].replace(stdins[0], stdins[1])
ans = sum([int(an) for an in a])
print(ans)
| n = int(eval(input()))
a = [int(an) for an in input().split()]
q = int(eval(input()))
for i in range(q):
stdins = input().split()
for j in range(n):
if a[j] == int(stdins[0]):
a[j] = int(stdins[1])
ans = sum([int(an) for an in a])
print(ans)
| p02630 |
from sys import stdin
from sys import setrecursionlimit
from collections import Counter
setrecursionlimit(10 ** 7)
n = int(eval(input()))
a = list(map(int,stdin.readline().rstrip().split()))
q = int(eval(input()))
cc = Counter(a)
for _ in range(q):
b,c = list(map(int,input().split()))
cc[c] += cc[b]
cc[b] -= cc[b]
su = 0
for i,j in list(cc.items()):
su += i*j
print(su) | from sys import stdin
from sys import setrecursionlimit
from collections import Counter
setrecursionlimit(10 ** 7)
n = int(eval(input()))
a = list(map(int,stdin.readline().rstrip().split()))
su = sum(a)
q = int(eval(input()))
cc = Counter(a)
for _ in range(q):
b,c = list(map(int,input().split()))
cc[c] += cc[b]
su += c*cc[b]-b*cc[b]
cc[b] -= cc[b]
print(su) | p02630 |
from sys import stdin
N = int(stdin.readline())
A = list(map(int,stdin.readline().split()))
A.sort()
Q = int(stdin.readline())
D = dict()
S = set(A)
sum=0
count=0
for y in range(0,N):
sum+=A[y]
if y>0 and A[y]!=A[y-1]:
D[A[y-1]]=count
count=1
elif y==0:
count=1
else:
count+=1
if y==N-1:
D[A[y]]=count
for u in range(0,Q):
U= list(map(int,stdin.readline().split()))
SS=S.copy()
SS.add(U[0])
if len(SS)==len(S):
SS.add(U[1])
if len(SS)==len(S):
sum+=(D[U[0]])*(U[1]-U[0])
D[U[1]]+=D[U[0]]
D[U[0]]=0
else:
sum += (D[U[0]]) * (U[1] - U[0])
D[U[1]]=D[U[0]]
D[U[0]]=0
S=SS
print(sum) | from sys import stdin
N = int(stdin.readline())
A = list(map(int,stdin.readline().split()))
A.sort()
Q = int(stdin.readline())
D = dict()
S = set(A)
sum=0
count=0
for y in range(0,N):
sum+=A[y]
if y>0 and A[y]!=A[y-1]:
D[A[y-1]]=count
count=1
elif y==0:
count=1
else:
count+=1
if y==N-1:
D[A[y]]=count
for u in range(0,Q):
U= list(map(int,stdin.readline().split()))
if U[0] in D:
sum+=(D[U[0]])*(U[1]-U[0])
if U[1] in D:
D[U[1]]+=D[U[0]]
else:
D[U[1]]=D[U[0]]
D[U[0]]=0
print(sum) | p02630 |
N=int(eval(input()))
listA=list(map(int, input().split()))
Q=int(eval(input()))
listB=[] #appendのために宣言が必要
while True:
try:
listB.append(list(map(int,input().split())))
except:
break;
sum=sum(listA)
numlist=[0]*(10**5+1)
for i in range(10**5+1):
numlist[i]=listA.count(i)
for i in range(Q):
B=listB[i][0]
C=listB[i][1]
if numlist[B]!=0:
sum=sum+(C-B)*numlist[B]
# print(C)
numlist[C]+=numlist[B]
numlist[B]=0
# print(numlist)
print(sum)
| N=int(eval(input()))
listA=list(map(int, input().split()))
Q=int(eval(input()))
listB=[] #appendのために宣言が必要
while True:
try:
listB.append(list(map(int,input().split())))
except:
break;
sum=sum(listA)
numlist=[0]*(10**5+1)
for i in listA:
numlist[i]+=1
for i in range(Q):
B=listB[i][0]
C=listB[i][1]
if numlist[B]!=0:
sum=sum+(C-B)*numlist[B]
# print(C)
numlist[C]+=numlist[B]
numlist[B]=0
# print(numlist)
print(sum)
| p02630 |
#import math
#import numpy as np
#import torch
#import torch.nn as nn
#import matplotlib.pyplot as plt
#from decimal import Decimal
#import itertools
import collections
N=int(eval(input()))
#N,K = map(int,input().split())
#B,W = map(int,input().split())
#T=int(input())
A = list(map(int,input().split()))
#S=str(input())
#A=[p for p in range(2*10**5)]
Q=int(eval(input()))
l=[]
for i in range(Q):
#print(A)
B,C = list(map(int,input().split()))
A=[C if x==B else x for x in A]
print((sum(A)))
| #import math
#import numpy as np
#import torch
#import torch.nn as nn
#import matplotlib.pyplot as plt
#from decimal import Decimal
#import itertools
import collections
N=int(eval(input()))
#N,K = map(int,input().split())
#B,W = map(int,input().split())
#T=int(input())
A = list(map(int,input().split()))
#S=str(input())
#A=[p for p in range(2*10**5)]
Q=int(eval(input()))
c=collections.Counter(A)
s=sum(A)
for i in range(Q):
#print(A)
B,C = list(map(int,input().split()))
if c[B]:
s += (C-B)*c[B]
c[C] += c[B]
c[B] = 0
print(s)
| p02630 |
n = int(eval(input()))
*a, = list(map(int, input().split()))
q = int(eval(input()))
d = [0]*(10**5+1)
for i in a:
d[i] += 1
for _ in [0]*q:
b, c = list(map(int, input().split()))
d[c] += d[b]
d[b] = 0
print((sum(i*j for i, j in enumerate(d)))) | n = int(eval(input()))
*a, = list(map(int, input().split()))
q = int(eval(input()))
d = {}
for i in a:
if i in d:
d[i] += 1
else:
d[i] = 1
ans = sum(a)
for _ in [0]*q:
b, c = list(map(int, input().split()))
if b in d:
if c in d:
d[c] += d[b]
else:
d[c] = d[b]
ans += (c-b)*d[b]
d[b] = 0
print(ans) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(int, input().split()))
num_dict = dict()
for i in a:
if i in list(num_dict.keys()):
num_dict[i] += 1
else:
num_dict[i] = 1
for i in range(q):
ans = 0
if b[i] in num_dict:
if c[i] in num_dict:
num_dict[c[i]] += num_dict.pop(b[i])
else:
num_dict[c[i]] = num_dict.pop(b[i])
for k, v in list(num_dict.items()):
ans += k*v
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(int, input().split()))
num_dict = dict()
for i in a:
if i in list(num_dict.keys()):
num_dict[i] += 1
else:
num_dict[i] = 1
ans = 0
for k, v in list(num_dict.items()):
ans += k*v
for i in range(q):
if b[i] in num_dict:
if c[i] in num_dict:
ans += (c[i] - b[i]) * num_dict[b[i]]
num_dict[c[i]] += num_dict.pop(b[i])
else:
ans += (c[i] - b[i]) * num_dict[b[i]]
num_dict[c[i]] = num_dict.pop(b[i])
#print(num_dict)
print(ans) | p02630 |
from collections import Counter
n = int(eval(input()))
nums = list(map(int, input().split()))
q = int(eval(input()))
vals = [tuple(map(int, input().split())) for _ in range(q)]
c = Counter(nums)
for b, k in vals:
o = c[b]
del c[b]
c[k] += o
total = sum([x*y for x, y in list(c.items())])
print(total) | from collections import Counter
n = int(eval(input()))
nums = list(map(int, input().split()))
q = int(eval(input()))
vals = [tuple(map(int, input().split())) for _ in range(q)]
c = Counter(nums)
total = sum([x*y for x, y in list(c.items())])
for b, k in vals:
o = c[b]
del c[b]
c[k] += o
total += k * o - b * o
print(total)
| p02630 |
# from math import sqrt
# from heapq import heappush, heappop
# from collections import deque
from operator import mul
from functools import reduce
# a, b = [int(v) for v in input().split()]
def main():
def modcmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
over = 1
under = 1
for i in range(r):
over = over * (n - i) % mod
under = under * (i + 1) % mod
# over = reduce(lambda v1, v2: (v1 * v2) % mod, range(n, n-r, -1))
# under = reduce(lambda v1, v2: (v1 * v2) % mod, range(1, r+1))
return (over * pow(under, mod - 2, mod)) % mod
mod = 1000000007
n, a, b = list(map(int, input().split()))
count = pow(2, n, mod) - 1
count -= modcmb(n, a, mod)
count -= modcmb(n, b, mod)
while count < 0:
count += mod
print((count % mod))
main()
| # from math import sqrt
# from heapq import heappush, heappop
# from collections import deque
from operator import mul
from functools import reduce
# a, b = [int(v) for v in input().split()]
def main():
def modcmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
over = 1
under = 1
for i in range(n, n-r, -1):
over = over * i % mod
for i in range(1, r+1):
under = under * i % mod
# over = reduce(lambda v1, v2: (v1 * v2) % mod, range(n, n-r, -1))
# under = reduce(lambda v1, v2: (v1 * v2) % mod, range(1, r+1))
return (over * pow(under, mod - 2, mod)) % mod
mod = 1000000007
n, a, b = list(map(int, input().split()))
count = pow(2, n, mod) - 1
count -= modcmb(n, a, mod)
count -= modcmb(n, b, mod)
while count < 0:
count += mod
print((count % mod))
main()
| p02768 |
# from math import sqrt
# from heapq import heappush, heappop
# from collections import deque
from operator import mul
from functools import reduce
# a, b = [int(v) for v in input().split()]
def main():
def modcmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
if r == 0:
return 1
over = 1
under = 1
# for i in range(n, n-r, -1):
# over = over * i % mod
# for i in range(1, r+1):
# under = under * i % mod
over = reduce(lambda v1, v2: (v1 * v2) % mod, list(range(n, n-r, -1)))
under = reduce(lambda v1, v2: (v1 * v2) % mod, list(range(1, r+1)))
return (over * pow(under, mod - 2, mod)) % mod
mod = 1000000007
n, a, b = list(map(int, input().split()))
count = pow(2, n, mod) - 1
count -= modcmb(n, a, mod)
count -= modcmb(n, b, mod)
while count < 0:
count += mod
print((count % mod))
main()
| # from math import sqrt
# from heapq import heappush, heappop
# from collections import deque
from operator import mul
from functools import reduce
# a, b = [int(v) for v in input().split()]
def main():
mod = 1000000007
n, a, b = list(map(int, input().split()))
def combi(n, r):
if r < 0 or r > n:
return 0
r = min(n - r, r)
over = 1
under = 1
for i in range(n - r + 1, n + 1):
over = over * i % mod
for i in range(1, r + 1):
under = under * i % mod
return over * modpow(under, mod-2) % mod
def modpow(n, r):
if r == 0:
return 1
v = modpow(n, r // 2)
v = v * v % mod
if r % 2 != 0:
v = v * n % mod
return v
ans = modpow(2, n) - 1
ans -= combi(n, a)
ans -= combi(n, b)
while ans < 0:
ans += mod
print(ans)
main()
| p02768 |
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def neko(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:
ans *= (n - k + 1) % mod
for i in range(2, k + 1):
inv[i] = mod - inv[mod % i] * (mod // i) % mod
ans = ans * (n - k + i) * inv[i] % mod
return ans
print(((pow(2, n, mod) - 1 - neko(n, a) - neko(n, b)) % mod))
| n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def neko(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
print(((pow(2, n, mod) - 1 - neko(n, a) - neko(n, b)) % mod))
| p02768 |
M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
f = c = 1
for i in range(b):
f = f * (i + 1) % M
c = c * (n - i) % M
if i + 1 in (a, b):
r -= c * pow(f, M - 2, M)
print((r % M))
| M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
f = c = 1
for i in range(b):
f = f * (i + 1) % M
c = c * (n - i) % M
if a != i + 1 != b:
continue
r -= c * pow(f, M - 2, M)
print((r % M))
| p02768 |
M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
f = c = 1
for i in range(b):
f = f * (i + 1) % M
c = c * (n - i) % M
if i + 1 in (a, b):
r -= c * pow(f, M - 2, M)
print((r % M))
| M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
f = c = 1
for i in range(b):
f = f * (i + 1) % M
c = c * (n - i) % M
if i + 1 == a:
a = b
r -= c * pow(f, M - 2, M)
print((r % M)) | p02768 |
from math import factorial
M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
c = 1
for i in range(b):
c = c * (n - i) % M
if i + 1 == a:
r -= c * pow(factorial(a) % M, M - 2, M)
a = b
print((r % M))
| M = 10**9 + 7
n, a, b = list(map(int, input().split()))
r = pow(2, n, M) - 1
f = c = 1
for i in range(b):
f = f * (i + 1) % M
c = c * (n - i) % M
if i + 1 == a:
a = b
r -= c * pow(f, M - 2, M)
print((r % M))
| p02768 |
from functools import reduce
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def f(A):
bunsi = reduce(lambda x, y: x*y%mod, list(range(n, n-A, -1)))
bunbo = reduce(lambda x, y: x*y%mod, list(range(1, A+1)))
return bunsi * pow(bunbo, mod-2, mod) % mod
ans = pow(2, n, mod) - f(a) -f(b) - 1
ans %= mod
print(ans) | from functools import reduce
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def comb(N, A, MOD):
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
print(((pow(2, n, mod) - 1 - comb(n, a, mod) - comb(n, b, mod))%mod)) | p02768 |
def cmb(n, r, mod):
c=1
for i in range(1, r+1):
c = (c * (n-i+1) * pow(i, mod-2, mod)) % mod
return c
n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
print(((pow(2, n, MOD) - cmb(n, a, MOD) - cmb(n, b, MOD) - 1) % MOD)) | n,a,b=list(map(int,input().split()))
mod=10**9+7
def comb(n,r):
P=1
R=1
for i in range(r):
P=P*(n-i)%mod
R=R*(r-i)%mod
return P*pow(R,mod-2,mod)%mod
combN=pow(2,n,mod)-1
print(((combN-comb(n,a)-comb(n,b))%mod)) | p02768 |
N, A, B = list(map(int, open(0).read().split()))
MOD = 10 ** 9 + 7
def comb(n, k):
ret = 1
for i in range(1, k + 1):
ret = ret * (n - i + 1) % MOD
ret = ret * pow(i, MOD - 2, MOD) % MOD
return ret
print(((pow(2, N, MOD) - 1 - comb(N, A) - comb(N, B)) % MOD))
|
N, A, B = list(map(int, input().split()))
MAX = 2 * 10 ** 5 + 1
MOD = 10 ** 9 + 7
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
# Factorial for large
facl = [0] * (MAX + 1)
facl[0] = N
for i in range(1, MAX + 1):
facl[i] = facl[i - 1] * (N - i) % MOD
# Solution
ans = pow(2, N, MOD) - 1
ans -= facl[A - 1] * finv[A] % MOD
ans %= MOD
ans -= facl[B - 1] * finv[B] % MOD
ans %= MOD
print(ans)
| p02768 |
def main():
from math import factorial
n, a, b = list(map(int, input().split()))
p = 1000000007
# 1:花束の組み合わせ総数の(mod p)
n_all = pow(2, n, p) -1
# 2:aとbの組み合わせ数の(mod p)を出す。
a_comb = 0 # aの組み合わせ数
a_comb_x = 1 # aの組み合わせ数計算の分子。n*(n-1)*…*(n-r+1)のmod p
a_comb_y = 1 # aの組み合わせ数計算の分母。r!のmod pにおける逆元
for i in range(n, n-a ,-1):
a_comb_x *= i
a_comb_x %= p
a_comb_y = factorial(a)
a_comb_y = pow(a_comb_y, p-2,p)
a_comb = (a_comb_x * a_comb_y) % p
b_comb = 0
b_comb_x = 1
b_comb_y = 1
for i in range(n, n-b ,-1):
b_comb_x *= i
b_comb_x %= p
b_comb_y = factorial(b)
b_comb_y = pow(b_comb_y, p-2,p)
b_comb = (b_comb_x * b_comb_y) % p
# 3: 1の結果から２のそれをマイナスする。結果が負になったら+p
r = n_all - a_comb
if r < 0:
r += p
r -= b_comb
if r < 0:
r += p
print(r)
main() | def main():
n, a, b = list(map(int, input().split()))
p = 10 ** 9 + 7
r = pow(2, n, p) - 1
if (n - a) < a:
a = n - a
if (n - b) < b:
b = n - b
fac_na = 1
for i1 in range(n, n - a, -1):
fac_na = (fac_na * i1) % p
fac_nb = 1
for i1 in range(n, n - b, -1):
fac_nb = (fac_nb * i1) % p
fac_a = 1
for i1 in range(1, a+1):
fac_a = (fac_a * i1) % p
fac_b = 1
for i1 in range(1, b+1):
fac_b = (fac_b * i1) % p
an = fac_na * pow(fac_a, p-2, p)
bn = fac_nb * pow(fac_b, p-2, p)
an = an % p
bn = bn % p
r -= an
if r < 0:
r += p
r -= bn
if r < 0:
r += p
if r < 0:
r += p
print((int(r)))
if __name__ == '__main__':
main() | 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
down%=mod
k-=1
down=loop_pow(down,10**9+5,mod)
return up*down%mod
def main():
N,a,b=list(map(int,input().split()))
mod=10**9+7
t=(loop_pow(2,N,mod)-1-com(N,a,mod)-com(N,b,mod))%mod
print(t)
if __name__=="__main__":
main() | def com(N,K,mod):
n=N
k=K
X=1 #分子
Y=1 #分母
for _ in range(K):
X*=n
X%=mod
n-=1
for _ in range(K):
Y*=k
Y%=mod
k-=1
Y=pow(Y,mod-2,mod) #Y**(mod-2) mod(mod)
return X*Y%mod #nCk mod(mod)
def main():
N,a,b=list(map(int,input().split()))
mod=1000000007
t=(pow(2,N,mod)-1-com(N,a,mod)-com(N,b,mod))%mod
print(t)
if __name__=="__main__":
main() | p02768 |
n,a,b=list(map(int,input().split()));k=1000000007
c=(1<<n)%k-1
X=1
for i in range(a):X=X*(n-i)%k
Y=j=1
while j<=a:Y=Y*j%k;j+=1
#Z=Y**(k-2)を計算，ビットワイズによる繰り返し２乗法の実装。
d=k-2;Z=1
while d>0:
Z=Z*Y%k if d&1==1 else Z
Y=Y*Y%k;d>>=1 #一周する度にY, Y^2, Y^4, Y^8となる; dのビット桁をずらす
c-=X*Z%k
X=1
for i in range(b):X=X*(n-i)%k
Y=j=1
while j<=b:Y=Y*j%k;j+=1
d=k-2;Z=1
while d>0:
Z=Z*Y%k if d&1==1 else Z
Y=Y*Y%k;d>>=1
c-=X*Z%k
print((c%k)) | n,*a=list(map(int,open(0).read().split()));k=1000000007
c=(1<<n)%k-1
for l in a:
X=Y=j=Z=1;d=k-2
for i in range(l):X=X*(n-i)%k
while j<=l:Y=Y*j%k;j+=1
while d>0:Z=Z*Y%k if d&1==1 else Z;Y=Y*Y%k;d>>=1
c-=X*Z%k
print((c%k)) | p02768 |
n,*a=list(map(int,open(0).read().split()));k=10**9+7
c=(1<<n)%k-1
for l in a:
X=Y=j=Z=1;d=k-2
for i in range(l):X=X*(n-i)%k
while j<=l:Y=Y*j%k;j+=1
while d>0:Z=Z*Y%k if d&1==1 else Z;Y=Y*Y%k;d>>=1
c-=X*Z%k
print((c%k)) | n,*A=list(map(int,open(0).read().split()));k=10**9+7
c=(1<<n)%k-1
for l in A:
X=Y=1
for i in range(l):X=X*(n-i)%k;Y=Y*(i+1)%k
c-=X*pow(Y,k-2,k)
print((c%k)) | p02768 |
n,*A=list(map(int,open(0).read().split()));k=10**9+7
c=(1<<n)%k-1
for l in A:
X=Y=1
for i in range(l):X=X*(n-i)%k;Y=Y*(i+1)%k
c-=X*pow(Y,k-2,k)
print((c%k)) | n,a,b=list(map(int,input().split()));k=10**9+7;c=(1<<n)%k-1;X=Y=1
for i in range(b):X=X*(n-i)%k;Y=Y*(i+1)%k;c-=X*pow(Y,k-2,k)if i+1 in(a,b) else 0
print((c%k)) | p02768 |
n,a,b=list(map(int,input().split()));k=10**9+7;c=(1<<n)%k-1;X=Y=1
for i in range(b):X=X*(n-i)%k;Y=Y*(i+1)%k;c-=X*pow(Y,k-2,k)if i+1 in(a,b) else 0
print((c%k)) | n,a,b=list(map(int,input().split()));k=10**9+7
c=(1<<n)%k-1
X=Y=1
for i in range(b):
X=X*(n-i)%k;Y=Y*(i+1)%k
if i+1 in(a,b):c-=X*pow(Y,k-2,k)
print((c%k)) | p02768 |
from functools import reduce
n,a,b=list(map(int,input().split()))
mod=10**9+7
def nCk(n,k):
c=reduce(lambda x,y: x*y%mod, list(range(n,n-k,-1)))
m=reduce(lambda x,y: x*y%mod, list(range(1,k+1)))
return c*pow(m,mod-2,mod)%mod
all=pow(2,n,mod)
nCa=nCk(n,a)
nCb=nCk(n,b)
print(((all-nCa-nCb-1)%mod)) | from functools import reduce
n,a,b=list(map(int,input().split()))
mod=10**9+7
def nCk(n,k):
if n<k or (n<0 or k<0):
return 0
k=min(k,n-k)
up,down=1,1
for i in range(k):
up=up*(n-i)%mod
down=down*(i+1)%mod
return up*pow(down,mod-2,mod)%mod
all=pow(2,n,mod)
nCa=nCk(n,a)
nCb=nCk(n,b)
print(((all-nCa-nCb-1)%mod)) | p02768 |
#!/usr/bin/env python3
from functools import reduce
mod = 10**9 + 7
def cmb(n, r, m):
mul = lambda a,b: a*b%m
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1, r + 1)))
return over * pow(under, mod - 2, mod)
n, a, b = list(map(int, input().split()))
print(((pow(2, n, mod) - 1 - cmb(n, a, mod) - cmb(n, b, mod)) % mod))
| #!/usr/bin/env python3
from functools import reduce
mod = 10**9 + 7
def cmb(n, r, m):
def mul(a, b):
return a * b % m
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1, r + 1)))
return over * pow(under, m - 2, m)
n, a, b = list(map(int, input().split()))
print(((pow(2, n, mod) - 1 - cmb(n, a, mod) - cmb(n, b, mod)) % mod))
| p02768 |
n,a,b = list(map(int,input().split()))
mod = 10 ** 9 + 7
k = max(a,b)
com = [1]
for i in range(1,k+1):
com.append((com[i-1]*(n-i+1)*pow(i,mod-2,mod))%mod)
print(((pow(2,n,mod)-1-com[a]-com[b])%mod)) | n,a,b = list(map(int,input().split()))
mod = 10 ** 9 + 7
def nCr(n,r):
if r*2>n:
return nCr(n,n-r)
else:
a = b = 1
for i in range(r):
a = a * (n - i) % mod
b = b * (r - i) % mod
return (a * pow(b,mod-2,mod)) % mod
ans = pow(2,n,mod) - 1 - nCr(n,a) - nCr(n,b)
print((ans%mod)) | p02768 |
n,a,b=list(map(int,input().split()))
MOD=10**9+7
def inv(a):
return pow(a,MOD-2,MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
A=B=1
ls_A=[1]
ls_B=[1]
for i in range(r):
A=ls_A[i]*(n-i)%MOD
ls_A.append(A)
B=ls_B[i]*(i+1)%MOD
ls_B.append(B)
return ls_A[r]*inv(ls_B[r])%MOD
def pow_k(x,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
n=n//2%MOD
return K*x%MOD
print(((pow_k(2,n)-1-choose(n,a)-choose(n,b))%MOD)) | n,a,b=list(map(int,input().split()))
MOD=10**9+7
def inv(a):
return pow(a,MOD-2,MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
A=B=1
for i in range(r):
A=A*(n-i)%MOD
B=B*(i+1)%MOD
return A*inv(B)%MOD
print(((pow(2,n,MOD)-1-choose(n,a)-choose(n,b))%MOD)) | p02768 |
p = 10 ** 9 + 7
n,a,b = list(map(int,input().split()))
k=max(a,b)
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
com=[0]*(k+1)
com[0]=1
for i in range(1, k+1):
com[i]=((com[i-1]*(n-i+1))*modinv(i,p))%p
print(((pow(2,n,p)-1-com[a]-com[b])%p))
| p = 10 ** 9 + 7
n,a,b = list(map(int,input().split()))
k=max(a,b)
def nCr(n, r, mod):
ret = [1]*(r+1)
for i in range(1, r+1):
ret[i] = (ret[i-1] * (n-i+1) * pow(i,mod-2,mod)) % mod
return ret
nCrl = nCr(n, k, p)
print(((pow(2,n,p)-1-nCrl[a]-nCrl[b])%p)) | p02768 |
def comb(n,r):
if n-r < r:
r=n-r
p=1
q=1
for i in range(r):
p *=n-i #=n(n-1)・・(n-r+1)
p %= mod
q *=i+1 #=1・2・・r =r!
q %=mod
return p*pow(q,mod-2,mod)
# 初期入力
N,a,b = (int(x) for x in input().split())
mod =10**9 +7
#
all_n =pow(2,N,mod) -1
#嫌いな数の組み合わせ
dislike_a =comb(N,a)
dislike_b =comb(N,b)
ans = (all_n -dislike_a -dislike_b)%mod
print(ans) |
# 組み合わせの総数 p=10**9+7 で割ったあまりを求める
"""n<10**9 ,r<10**7 ,p は素数"""
def comb(n,r):
if n-r < r:
r=n-r
p=1
q=1
for i in range(r):
p *=n-i #=n(n-1)・・(n-r+1)
p %= mod
q *=i+1 #=1・2・・r =r!
q %=mod
return p*pow(q,mod-2,mod)
# 初期入力
N,a,b = (int(x) for x in input().split())
mod =10**9 +7
#N種類の花1本以上の組み合わせ全て(0本選ぶは×なので-1)
all = pow(2,N,mod)-1
#嫌いな本数の組み合わせ
comb_a =comb(N,a)
comb_b =comb(N,b)
ans =(all -comb_a -comb_b)% mod
print(ans) | p02768 |
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
import time
start = time.time()
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# xの逆元を求める。フェルマーの小定理より、 x の逆元は x ^ (mod - 2) に等しい。計算時間はO(log(mod))程度。
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
def modinv(x):
return power(x, mod-2)
modinv_table = [-1] * (b+1)
for i in range(1, b+1):
modinv_table[i] = modinv(i)
end = time.time()
# print("time: ", end - start)
def binomial_coefficients2(n, k):
ans = 1
for i in range(k):
ans *= n-i
ans *= modinv_table[i + 1]
ans %= mod
return ans
# (2 ** n - 1) - nCa - nCb
ans = power(2, n) - 1
ans -= (binomial_coefficients2(n, a) + binomial_coefficients2(n, b))
print((ans % mod))
# print(binomial_coefficients2 (5, 2) % mod)
| n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
import time
start = time.time()
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# 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):
modinv_table[i] = modinv(i)
end = time.time()
# print("time: ", end - start)
def binomial_coefficients2(n, k):
ans = 1
for i in range(k):
ans *= n-i
ans *= modinv_table[i + 1]
ans %= mod
return ans
# (2 ** n - 1) - nCa - nCb
ans = power(2, n) - 1
ans -= (binomial_coefficients2(n, a) + binomial_coefficients2(n, b))
print((ans % mod))
# print(binomial_coefficients2 (5, 2) % mod)
| p02768 |
n,a,b=list(map(int,input().split()))
c=10**9+7
nca=1
ncb=1
for i in range(a):
nca*=(n-i)*pow(i+1,c-2,c)
nca%=c
for i in range(b):
ncb*=(n-i)*pow(i+1,c-2,c)
ncb%=c
ans=pow(2,n,c)-1-(nca+ncb)
ans%=c
print(ans) | n,a,b=list(map(int,input().split()))
c=10**9+7
def com(n,k,c):
l=1
m=1
for i in range(k):
l*=n-i
m*=i+1
l%=c
m%=c
return l*pow(m,c-2,c)%c
ans=pow(2,n,c)-1-com(n,a,c)-com(n,b,c)
ans%=c
print(ans) | 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 0 <= x < MOD else x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x + other.x, self.mod)
else:
return ModInt(self.x + other, self.mod)
def __sub__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x - other.x, self.mod)
else:
return ModInt(self.x - other, self.mod)
def __mul__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * other.x, self.mod)
else:
return ModInt(self.x * other, self.mod)
def __truediv__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * pow(other.x, self.mod - 2, self.mod))
else:
return ModInt(self.x * pow(other, self.mod - 2, self.mod))
def __pow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(self.x, other.x, self.mod))
else:
return ModInt(pow(self.x, other, self.mod))
__radd__ = __add__
def __rsub__(self, other): # 演算の順序が逆
if isinstance(other, ModInt):
return ModInt(other.x - self.x, self.mod)
else:
return ModInt(other - self.x, self.mod)
__rmul__ = __mul__
def __rtruediv__(self, other):
if isinstance(other, ModInt):
return ModInt(other.x * pow(self.x, self.mod - 2, self.mod))
else:
return ModInt(other * pow(self.x, self.mod - 2, self.mod))
def __rpow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(other.x, self.x, self.mod))
else:
return ModInt(pow(other, self.x, self.mod))
def combination_mod(n, r, mod):
if r > n:
return 0 # このような通りの数は無いため便宜上こう定義する
r = min(r, n - r)
nf = rf = 1
for i in range(r):
nf = nf * (n - i) % mod
rf = rf * (i + 1) % mod
return nf * pow(rf, mod - 2, mod) % mod
def combination(n, r):
if r > n:
return 0 # このような通りの数は無いため便宜上こう定義する
r = min(r, n - r)
nf = rf = ModInt(1)
for i in range(r):
nf = nf * (n - i)
rf = rf * (i + 1)
return nf / rf
# すべての通り(2^n-1)からnCa,nCbを引けば良い
MOD = 10**9 + 7
n, a, b = read_ints()
# tmp = pow(2, n, MOD) - 1
# ans = tmp - combination_mod(n, a, MOD) - combination_mod(n, b, MOD)
# print(ans % MOD)
tmp = ModInt(2)**n - 1
ans = tmp - combination(n, a) - combination(n, b)
print(ans)
| # 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):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x + other.x)
else:
return ModInt(self.x + other)
def __sub__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x - other.x)
else:
return ModInt(self.x - other)
def __mul__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * other.x)
else:
return ModInt(self.x * other)
def __truediv__(self, other):
if isinstance(other, ModInt):
return ModInt(self.x * pow(other.x, MOD - 2, MOD))
else:
return ModInt(self.x * pow(other, MOD - 2, MOD))
def __pow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(self.x, other.x, MOD))
else:
return ModInt(pow(self.x, other, MOD))
__radd__ = __add__
def __rsub__(self, other): # 演算の順序が逆
if isinstance(other, ModInt):
return ModInt(other.x - self.x)
else:
return ModInt(other - self.x)
__rmul__ = __mul__
def __rtruediv__(self, other):
if isinstance(other, ModInt):
return ModInt(other.x * pow(self.x, MOD - 2, MOD))
else:
return ModInt(other * pow(self.x, MOD - 2, MOD))
def __rpow__(self, other):
if isinstance(other, ModInt):
return ModInt(pow(other.x, self.x, MOD))
else:
return ModInt(pow(other, self.x, MOD))
def combination_mod(n, r, mod):
if r > n:
return 0 # このような通りの数は無いため便宜上こう定義する
r = min(r, n - r)
nf = rf = 1
for i in range(r):
nf = nf * (n - i) % mod
rf = rf * (i + 1) % mod
return nf * pow(rf, mod - 2, mod) % mod
def combination(n, r):
if r > n:
return 0 # このような通りの数は無いため便宜上こう定義する
r = min(r, n - r)
nf = rf = ModInt(1)
for i in range(r):
nf = nf * (n - i)
rf = rf * (i + 1)
return nf / rf
# すべての通り(2^n-1)からnCa,nCbを引けば良い
MOD = 10**9 + 7
n, a, b = read_ints()
# tmp = pow(2, n, MOD) - 1
# ans = tmp - combination_mod(n, a, MOD) - combination_mod(n, b, MOD)
# print(ans % MOD)
tmp = ModInt(2)**n - 1
ans = tmp - combination(n, a) - combination(n, b)
print(ans)
| p02768 |
n, a, b = list(map(int, input().split()))
mod = 10**9+7
def cmb2(n, r, mod):
res = 1
for k in range(1, r+1):
res *= (n-k+1)*pow(k,(mod-2),mod)%mod
res %= mod
return res
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1
ans %= mod
print(ans) | n, a, b = list(map(int, input().split()))
mod = 10**9+7
def cmb2(n, r, mod):
res = 1
temp = 1
for k in range(1, r+1):
res *= (n-k+1)
temp *= k
res %= mod
temp %= mod
res *= pow(temp,(mod-2),mod)
res %= mod
return res
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1
ans %= mod
print(ans)
| p02768 |
mod = 1000000007
# 繰り返し二乗法
def mod_pow(a, n, p):
if n == 1:
return a % p
if n % 2 == 1:
return (a* mod_pow(a, n - 1, p)) % p
tmp = mod_pow(a, n / 2, p)
return ( tmp * tmp ) % p
# 組み合わせ
def mod_cmb(n, k, p):
if n < 0 or k < 0 or n < k: return 0
if n == 0 or k == 0: return 1
if (k > n - k):
return mod_cmb(n, n - k, p)
c = d = 1
for i in range(k):
c *= (n - i)
d *= (k - i)
c %= p
d %= p
return c * mod_pow(d, p - 2, p) % p
def main():
n, a, b = list(map(int, input().split()))
ans = mod_pow(2, n, mod) - 1
tmp_a = mod_cmb(n , a, mod)
tmp_b = mod_cmb(n , b, mod)
print(((ans-tmp_a-tmp_b)%mod))
if __name__ == '__main__':
main() | mod = 1000000007
def mod_cmb(n: int, k: int, p: int) -> int:
if n < 0 or k < 0 or n < k: return 0
if n == 0 or k == 0: return 1
if (k > n - k):
return mod_cmb(n, n - k, p)
c = d = 1
for i in range(k):
c *= (n - i)
d *= (k - i)
c %= p
d %= p
return c * pow(d, -1, p) % p
def main():
n, a, b = list(map(int, input().split()))
ans = pow(2, n, mod) - 1
tmp_a = mod_cmb(n , a, mod)
tmp_b = mod_cmb(n , b, mod)
print(((ans-tmp_a-tmp_b)%mod))
if __name__ == '__main__':
main()
| p02768 |
Q = 10**9+7
def getInv(N):
inv = [0] * (N + 1)
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q % i]) % Q
return inv
def main():
n, a, b = list(map( int, input().split()))
Inv = getInv(2*10**5)
def cmb(n,r):
ret = 1
for i in range(r):
ret *= n-i
ret %= Q
ret *= Inv[i+1]
ret %= Q
return ret
print(( (pow(2,n,Q) - cmb(n,a) - cmb(n,b)-1)%Q))
if __name__ == '__main__':
main() | Q = 10**9+7
def cmb(n,r):
if n-r < r: r = n-r
if r == 0: return 1
denominator = 1 #分母
numerator = 1 #分子
for i in range(r):
numerator *= n-i
numerator %= Q
denominator *= i+1
denominator %= Q
return numerator*pow(denominator, Q-2, Q)%Q
def main():
n, a, b = list(map( int, input().split()))
print(( (pow(2,n,Q) - cmb(n,a) - cmb(n,b)-1)%Q))
if __name__ == '__main__':
main()
| p02768 |
def pow(a,b,c):
ans = 1
while b > 0:
if b & 1:
ans = ans*a % c
a = a*a % c
b = b >> 1
return ans
def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(n-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num*pow(den,c-2,c) % c
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = (pow(2,n,mod)-cmb(n,a,mod)-cmb(n,b,mod)-1) % mod
if ans < 0:
ans = ans + mod
print(ans) | def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(n-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num*pow(den,-1,c) % c
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = (pow(2,n,mod)-cmb(n,a,mod)-cmb(n,b,mod)-1) % mod
if ans < 0:
ans = ans + mod
print(ans) | p02768 |
def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(n-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num*pow(den,-1,c) % c
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = (pow(2,n,mod)-cmb(n,a,mod)-cmb(n,b,mod)-1) % mod
if ans < 0:
ans = ans + mod
print(ans) | def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(n-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num*pow(den,c-2,c) % c
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = (pow(2,n,mod)-cmb(n,a,mod)-cmb(n,b,mod)-1) % mod
if ans < 0:
ans = ans + mod
print(ans) | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
c,d=1,1
for i in range(n-a+1,n+1):
c=i*c%mod
for i in range(1,a+1):
c=c*pow(i,mod-2,mod)%mod
for i in range(n-b+1,n+1):
d=i*d%mod
for i in range(1,b+1):
d=d*pow(i,mod-2,mod)%mod
print(((pow(2,n,mod)-c-d-1)%mod)) | def main():
n,a,b=list(map(int,input().split()))
mod=10**9+7
c,d=1,1
for i in range(n-a+1,n+1):
c=i*c%mod
for i in range(1,a+1):
c=c*pow(i,mod-2,mod)%mod
for i in range(n-b+1,n+1):
d=i*d%mod
for i in range(1,b+1):
d=d*pow(i,mod-2,mod)%mod
print(((pow(2,n,mod)-c-d-1)%mod))
main() | p02768 |
n, a, b = list(map(int, input().split()))
P = 10 ** 9 + 7
def conb(n, r):
resp = n
for i in range(1, r):
resp = (resp * (n - i) * pow(i + 1, P - 2))%P
return resp
def pow(x, n):
ans = 1
while (n > 0):
if (bin(n & 1) == bin(1)):
ans = (ans * x)%P
x = (x * x) % P
n = n >> 1 # ビットシフト
return ans
print(((pow(2, n) - conb(n, a) - conb(n, b)-1)%P))
| n, a, b = list(map(int, input().split()))
P = 10 ** 9 + 7
def conb(n, r):
P = 10 ** 9 + 7
x = 1
y = 1
for i in range(n - r + 1, n + 1):
x = (x * i % P)
for i in range(1, r + 1):
y = (y * i % P)
y_inv = pow(y, P - 2)
return x * y_inv
def pow(x, n):
ans = 1
while (n > 0):
if (bin(n & 1) == bin(1)):
ans = (ans * x) % P
x = (x * x) % P
n = n >> 1 # ビットシフト
return ans
print(((pow(2, n) - conb(n, a) - conb(n, b) - 1) % P))
| p02768 |
def cmb(n, r, p):
# ex. 5_C_4 = 5_C_1、rが小さい方を計算したほうが楽
r = min(r, n - r)
# n*(n-1)*...*(n-r+1)
# 組み合わせの公式の分子
upper = 1
for i in range(n, n - r, -1):
upper = (upper * i) % p
# 1*2*...*r
# 組み合わせの公式の分母
lower = 1
for i in range(1, r + 1):
lower = (lower * i) % p
# 剰余の計算において、+-*は良いが、/は普通にやると成り立たない
# ex. 6/3(mod5)...2になって欲しいが1/3になってしまう
# 割るのではなく、「逆元」を掛けるとすれば割らなくて済む
# フェルマーの小定理より、pが素数なら1/lowerの逆元はlower**(p-2)
# powの第3引数を使うことで繰り返し二乗法になる
return (upper * pow(lower, p - 2, p)) % p
mod = pow(10, 9) + 7
n, a, b = list(map(int, input().split()))
# 全ての選び方-何も選ばない時-a本の時-b本の時
ans = (pow(2, n, mod) - 1 - cmb(n, a, mod) - cmb(n, b, mod)) % mod
print(ans)
| def cmb(n, r, p):
r = min(r, n - r)
# n*(n-1)*...*(n-r+1)
# 組み合わせの分子
upper = 1
for i in range(n, n - r, -1):
upper = (upper * i) % p
# 1*2*...*r
# 組み合わせの分母
lower = 1
for i in range(1, r + 1):
lower = (lower * i) % p
# 剰余の計算において、+-*は良いが、/は普通にやると成り立たない
# 割るのではなく、「逆元」を掛けるとする
# フェルマーの小定理より、pが素数なら1/lowerの逆元はlower**(p-2)
# powの第3引数を使うことで繰り返し二乗法になる
return (upper * pow(lower, p - 2, p)) % p
mod = pow(10, 9) + 7
n, a, b = list(map(int, input().split()))
# 全ての選び方-何も選ばない時-a本の時-b本の時
ans = (pow(2, n, mod) - 1 - cmb(n, a, mod) - cmb(n, b, mod)) % mod
print(ans)
| p02768 |
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
ans = pow(2, n, MOD) - 1
# invs[x]: xの逆元 (x:0～n)
def getInvs(n, MOD):
invs = [1] * (n+1)
for x in range(2, n+1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
return invs
invs = getInvs(2*10**5, MOD)
def f(n, k):
num = 1
for i in range(n-k+1, n+1):
num *= i
num %= MOD
for i in range(k+1):
num *= invs[i]
num %= MOD
return num
numA = f(n, a)
numB = f(n, b)
#print('numA:', numA, '/ numB:', numB)
print(((ans - numA - numB) % MOD))
| MOD = 10**9 + 7
N, A, B = list(map(int, input().split()))
def getComb(n, k, MOD):
if n < k:
return 0
if n-k < k:
k = n-k
comb = 1
for x in range(n-k+1, n+1):
comb = (comb * x) % MOD
d = 1
for x in range(1, k+1):
d = (d * x) % MOD
comb *= pow(d, MOD-2, MOD)
return comb % MOD
ans = pow(2, N, MOD) - 1
ans -= getComb(N, A, MOD)
ans -= getComb(N, B, MOD)
ans %= MOD
print(ans)
| p02768 |
def main():
n,a,b = list(map(int,input().split()))
MOD = 10**9 +7
s = pow(2,n,MOD)-1
P_ni = 1
F_i = 1
s = s - comb_mod(n,a,MOD)
s = s - comb_mod(n,b,MOD)
print((s%MOD))
def comb_mod(n, k, mod):
numerator = 1
denominator = 1
for i in range(k):
numerator = (numerator * (n - i)) % mod
denominator = (denominator * (i + 1)) % mod
return (numerator * pow(denominator, mod - 2, mod)) % mod
if __name__=='__main__':
main()
| def main():
n,a,b = list(map(int,input().split()))
MOD = 10**9 +7
s = pow(2,n,MOD)-1
print((comb_mod(n,MOD,a,b,s)))
def comb_mod(n, mod,a,b,s):
numerator = 1
denominator = 1
for i in range(b):
numerator = (numerator * (n - i)) % mod
denominator = (denominator * (i + 1)) % mod
if i == a-1 or i == b-1:
s = s - (numerator * pow(denominator, mod - 2, mod)) % mod
return s%mod
if __name__=='__main__':
main()
| p02768 |
MOD = 10**9 + 7
def comb(n, k, MOD):
if n < k or n < 0 or k < 0:
return 0
if k == 0:
return 1
iinv = [1] * (k + 1)
ans = n
for i in range(2, k + 1):
iinv[i] = MOD - iinv[MOD % i] * (MOD // i) % MOD
ans *= (n + 1 - i) * iinv[i] % MOD
ans %= MOD
return ans
n, a, b = list(map(int, input().split()))
print(((pow(2,n,MOD)-1-comb(n,a,MOD)-comb(n,b,MOD)+MOD*10)%MOD)) | MOD = 10**9 + 7
def comb(n, k, MOD):
if n < k or n < 0 or k < 0:
return 0
if k == 0:
return 1
iinv = [1] * (k + 1)
ans = n
for i in range(2, k + 1):
iinv[i] = MOD - iinv[MOD % i] * (MOD // i) % MOD
ans *= (n + 1 - i) * iinv[i] % MOD
ans %= MOD
return ans
n, a, b = list(map(int, input().split()))
ans = pow(2,n,MOD)
print((((ans-comb(n,a,MOD))%MOD-comb(n,b,MOD))%MOD-1)) | p02768 |
n, a, b = list(map(int, input().split()))
def modpow(a, b, mod=10 ** 9 + 7):
ret = 1
while b > 0:
if b % 2 == 1:
ret = ret * a % mod
a = a * a % mod
b //= 2
return ret
def modcomb(n, c, mod=10 ** 9 + 7):
if c > n - c:
c = n - c
u, d = 1, 1
for i in range(c):
u = u * (n - i) % mod
d = d * (i + 1) % mod
return u * modpow(d, mod - 2) % mod
print(((modpow(2, n) - modcomb(n, a) - modcomb(n, b)) % (10 ** 9 + 7) - 1))
| def modpow(a, b, mod=10 ** 9 + 7):
ret = 1
while b > 0:
if b % 2 == 1:
ret = ret * a % mod
a = a * a % mod
b //= 2
return ret
def modcomb(n, c, mod=10 ** 9 + 7):
if c > n - c:
c = n - c
u, d = 1, 1
for i in range(c):
u = u * (n - i) % mod
d = d * (i + 1) % mod
return u * modpow(d, mod - 2) % mod
mod = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
ans = (modpow(2, n) - 1) % mod
ans = (ans - modcomb(n, a)) % mod
ans = (ans - modcomb(n, b)) % mod
print(ans)
| p02768 |
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 = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1, r, p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
result %= M
return result
def pow(x, n):
ans = 1
while(n > 0):
if(bin(n & 1) == bin(1)):
ans = (ans*x) % M
x = (x*x) % M
n = n >> 1 # ビットシフト
return ans
N, a, b = list(map(int, input().split()))
M = 10**9+7
print(((pow(2, N) - cmb(N, a)-cmb(N, b)-1) % M))
| def cmb(n, r, mod):
p, q = 1, 1
for i in range(r):
p *= n - i
p %= mod
q *= i + 1
q %= mod
# 1/q!の逆元をかける(= q! ^ (mod-2) % mod)
return p * pow(q, mod - 2, mod)
N, a, b = list(map(int, input().split()))
MOD = 10**9+7
print(((pow(2, N, MOD) - cmb(N, a, MOD)-cmb(N, b, MOD)-1) % MOD))
| p02768 |
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x)
if isinstance(other, ModInt)
else ModInt(self.x + other)
)
def __sub__(self, other):
return (
ModInt(self.x - other.x)
if isinstance(other, ModInt)
else ModInt(self.x - other)
)
def __mul__(self, other):
return (
ModInt(self.x * other.x)
if isinstance(other, ModInt)
else ModInt(self.x * other)
)
def __truediv__(self, other):
return (
ModInt(self.x * pow(other.x, MOD - 2, MOD))
if isinstance(other, ModInt)
else ModInt(self.x * pow(other, MOD - 2, MOD))
)
def __pow__(self, other):
return (
ModInt(pow(self.x, other.x, MOD))
if isinstance(other, ModInt)
else ModInt(pow(self.x, other, MOD))
)
__radd__ = __add__
def __rsub__(self, other):
return (
ModInt(other.x - self.x)
if isinstance(other, ModInt)
else ModInt(other - self.x)
)
__rmul__ = __mul__
def __rtruediv__(self, other):
return (
ModInt(other.x * pow(self.x, MOD - 2, MOD))
if isinstance(other, ModInt)
else ModInt(other * pow(self.x, MOD - 2, MOD))
)
def __rpow__(self, other):
return (
ModInt(pow(other.x, self.x, MOD))
if isinstance(other, ModInt)
else ModInt(pow(other, self.x, MOD))
)
def main():
N, A, B = list(map(int, input().split()))
total = ModInt(2) ** N - 1
num_a = ModInt(1)
for i in range(A):
num_a *= N - i
num_a /= A - i
num_b = ModInt(1)
for i in range(B):
num_b *= N - i
num_b /= B - i
total -= num_a
total -= num_b
print(total)
if __name__ == "__main__":
main()
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x)
if isinstance(other, ModInt)
else ModInt(self.x + other)
)
def __sub__(self, other):
return (
ModInt(self.x - other.x)
if isinstance(other, ModInt)
else ModInt(self.x - other)
)
def __mul__(self, other):
return (
ModInt(self.x * other.x)
if isinstance(other, ModInt)
else ModInt(self.x * other)
)
def __truediv__(self, other):
return (
ModInt(self.x * pow(other.x, MOD - 2, MOD))
if isinstance(other, ModInt)
else ModInt(self.x * pow(other, MOD - 2, MOD))
)
def __pow__(self, other):
return (
ModInt(pow(self.x, other.x, MOD))
if isinstance(other, ModInt)
else ModInt(pow(self.x, other, MOD))
)
__radd__ = __add__
def __rsub__(self, other):
return (
ModInt(other.x - self.x)
if isinstance(other, ModInt)
else ModInt(other - self.x)
)
__rmul__ = __mul__
def __rtruediv__(self, other):
return (
ModInt(other.x * pow(self.x, MOD - 2, MOD))
if isinstance(other, ModInt)
else ModInt(other * pow(self.x, MOD - 2, MOD))
)
def __rpow__(self, other):
return (
ModInt(pow(other.x, self.x, MOD))
if isinstance(other, ModInt)
else ModInt(pow(other, self.x, MOD))
)
def main():
N, A, B = list(map(int, input().split()))
total = ModInt(2) ** N - 1
MAX = max(A, B)
MIN = min(A, B)
num = ModInt(1)
for i in range(MAX):
if i == MIN:
total -= num
num *= N - i
num /= i + 1
total -= num
print(total)
if __name__ == "__main__":
main()
| p02768 |
import math
# xのn乗
def pow_k(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
# nCkの導出
def comb(n,k):
nCk = 1
# X
for i in range(n-k+1, n+1):
nCk *= i
nCk %= mod
# Y
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
# ans = pow_k(2,n) - c(n,a) - c(n,b) - 1
ans = pow(2,n,mod) - 1 - comb(n,a) - comb(n,b)
print((ans%mod)) | MOD = 10**9+7
def comb(n,k):
nCk = 1
# X
for i in range(n-k+1, n+1):
nCk *= i
nCk %= MOD
# Y
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()))
ans = pow(2, n, MOD) - comb(n, a) - comb(n, b) - 1
print((ans%MOD)) | p02768 |
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
def C(n,r):
p = n*pow(r,MOD-2,MOD)
for i in range(1,r):
p = p*(n-i)%MOD
p = p * pow(i,MOD-2,MOD)
return p%MOD
print(((pow(2,n,MOD) - C(n,a) - C(n,b)-1)%MOD)) | from functools import reduce
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
def combination2(n, r, MOD=10**9+7):
if not 0 <= r <= n: return 0
r = min(r, n - r)
numerator = reduce(lambda x, y: x * y % MOD, list(range(n, n - r, -1)), 1)
denominator = reduce(lambda x, y: x * y % MOD, list(range(1, r + 1)), 1)
return numerator * pow(denominator, MOD - 2, MOD) % MOD
print(((pow(2,n,MOD) - combination2(n,a) - combination2(n,b)-1)%MOD)) | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
def pow(n, p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
return res % mod
def large_conbination(n,k,mod=10**9+7): #needs pow method. return nCk.
res1 = 1
for i in range(n,n-k,-1):
res1*=i
res1%=mod
res2 = 1
for i in range(1,k+1):
res2*= pow(i,mod-2) #フェルマーの小定理を用いて分母を計算
res2%=mod
return res1*res2%mod
ans = pow(2,n) -1
ans -= large_conbination(n,a)
ans -= large_conbination(n,b)
while ans<0:
ans += mod
print((ans%mod)) | n,a,b = list(map(int,input().split()))
mod = 10**9+7
def pow(n, p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
return res % mod
def large_conbination(n,k,mod=10**9+7): #needs pow method. return nCk.
res1 = 1
for i in range(n,n-k,-1):
res1*=i
res1%=mod
res2 = 1
for i in range(1,k+1):
res2*= i
res2%=mod
return res1*pow(res2,mod-2)%mod
ans = pow(2,n) -1
ans -= large_conbination(n,a)
ans -= large_conbination(n,b)
while ans<0:
ans += mod
print((ans%mod)) | p02768 |
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect
MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()
def inv_mod(a, N):
"""
Fermatの小定理より(Nが素数のときしか使えない)
aの逆元 ax = 1 (mod N)を満たすx = a^(N-2) mod Nを返す。
O(log N)
"""
def bpm(x, y, N):
"""
Bisection power method : 二分累乗法
O(log y)でx^(y) mod N を求める。
"""
ans = 1
x %= MOD
digit = int((math.log(y, 2) // 1 + 1)) # yの２進数表示の桁数
for i in range(digit):
if (y >> i) & 1 == 1:
ans *= x
ans %= MOD
x **= 2
x %= MOD
return ans
return bpm(a, N - 2, N)
def bpm(x, y, N):
"""
Bisection power method : 二分累乗法
O(log y)でx^(y) mod N を求める。
"""
ans = 1
x %= MOD
digit = int((math.log(y, 2) // 1 + 1)) # yの２進数表示の桁数
for i in range(digit):
if (y >> i) & 1 == 1:
ans *= x
ans %= MOD
x **= 2
x %= MOD
return ans
n, a, b = list(map(int, input().split()))
nCa = 1
nCb = 1
inv_list = []
for i in range(max(a, b)):
inv_list.append(inv_mod(i + 1, MOD))
for i in range(a):
nCa *= inv_list[i]
nCa %= MOD
nCa *= n - i
nCa %= MOD
for i in range(b):
nCb *= inv_list[i]
nCb %= MOD
nCb *= n - i
nCb %= MOD
print(((bpm(2, n, MOD) - 1 - nCa - nCb) % MOD))
| import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect
MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()
def inv_mod(a, N):
"""
Fermatの小定理より(Nが素数のときしか使えない)
aの逆元 ax = 1 (mod N)を満たすx = a^(N-2) mod Nを返す。
O(log N)
"""
def bpm(x, y, N):
"""
Bisection power method : 二分累乗法
O(log y)でx^(y) mod N を求める。
"""
ans = 1
x %= MOD
digit = int((math.log(y, 2) // 1 + 1)) # yの２進数表示の桁数
for i in range(digit):
if (y >> i) & 1 == 1:
ans *= x
ans %= MOD
x **= 2
x %= MOD
return ans
return bpm(a, N - 2, N)
def bpm(x, y, N):
"""
Bisection power method : 二分累乗法
O(log y)でx^(y) mod N を求める。
"""
ans = 1
x %= MOD
digit = int((math.log(y, 2) // 1 + 1)) # yの２進数表示の桁数
for i in range(digit):
if (y >> i) & 1 == 1:
ans *= x
ans %= MOD
x **= 2
x %= MOD
return ans
n, a, b = list(map(int, input().split()))
nCa = 1
nCb = 1
inv_list = [1] # 0で割るというのは定義されないので無視。
for i in range(max(a, b)):
inv_list.append(int(MOD - inv_list[(MOD % (i + 2)) - 1] * (MOD // (i + 2)) % MOD))
for i in range(a):
nCa *= inv_list[i]
nCa %= MOD
nCa *= n - i
nCa %= MOD
for i in range(b):
nCb *= inv_list[i]
nCb %= MOD
nCb *= n - i
nCb %= MOD
print(((bpm(2, n, MOD) - 1 - nCa - nCb) % MOD))
| p02768 |
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)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
return fac(n) * inv(fac(n-k)) % MOD
def nCk(n,k):
return nPk(n,k) * inv(fac(k))
MOD = 10**9+7
def fac(N):
known = { 0: 1, 1000000000: 698611116, 320000000: 30977140, 820000000: 629786193, 740000000: 375297772, 470000000: 909210595, 200000000: 933245637, 940000000: 83868974, 400000000: 429277690, 130000000: 623534362, 870000000: 256473217, 600000000: 724464507, 330000000: 522049725, 60000000: 27368307, 800000000: 203191898, 530000000: 256141983, 260000000: 135498044, 730000000: 663307737, 460000000: 275105629, 190000000: 109838563, 930000000: 778983779, 660000000: 769795511, 390000000: 917084264, 120000000: 661224977, 860000000: 116667533, 10000000: 682498929, 590000000: 131772368, 50000000: 67347853, 790000000: 748510389, 520000000: 608823837, 250000000: 112390913, 990000000: 847549272, 720000000: 852304035, 450000000: 462639908, 180000000: 547665832, 920000000: 193781724, 650000000: 92255682, 380000000: 940567523, 110000000: 281863274, 850000000: 823845496, 580000000: 848924691, 310000000: 128487469, 40000000: 723816384, 780000000: 624500515, 510000000: 97830135, 240000000: 136026497, 980000000: 377329025, 710000000: 435887178, 440000000: 780072518, 170000000: 66404266, 20000000: 491101308, 670000000: 373745190, 910000000: 172114298, 640000000: 903466878, 370000000: 148528617, 100000000: 927880474, 840000000: 814362881, 570000000: 811575797, 300000000: 668123525, 30000000: 76479948, 770000000: 671734977, 500000000: 733333339, 230000000: 268838846, 970000000: 492741665, 700000000: 957939114, 430000000: 568392357, 160000000: 195888993, 900000000: 586445753, 630000000: 456152084, 360000000: 189239124, 90000000: 888050723, 830000000: 672850561, 560000000: 637939935, 290000000: 500780548, 760000000: 624148346, 490000000: 703397904, 220000000: 368925948, 270000000: 217544623, 960000000: 965785236, 690000000: 825871994, 420000000: 358655417, 150000000: 261384175, 890000000: 245795606, 620000000: 326159309, 350000000: 386027524, 80000000: 199888908, 550000000: 696628828, 280000000: 419363534, 750000000: 217598709, 480000000: 99199382, 210000000: 724691727, 950000000: 315103615, 680000000: 606241871, 410000000: 996164327, 140000000: 970055531, 880000000: 627655552, 610000000: 272814771, 340000000: 309058615, 70000000: 625544428, 810000000: 423951674, 540000000: 141827977}
ans = known[ N - N % int( 1e7 ) ]
for i in range( N - N % int( 1e7 ) + 1, N + 1, 1 ):
ans = ans * i % MOD
return ans
n,a,b = get_nums_l()
nCa = nCk(n,a)
nCb = nCk(n,b)
ans = pow(2, n, MOD) - 1 - nCa - nCb
print(ans % (10**9 + 7))
| 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)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
x = 1
for a in range(n-k+1, n+1):
x = x * a % MOD
return x
def nCk(n,k):
return nPk(n,k) * inv(kaijo[k])
MOD = 10**9+7
kaijo = [0] * 400020
kaijo[0] = 1
for i in range(1, len(kaijo)):
kaijo[i] = kaijo[i-1] * i % MOD
# def fac(N):
# known = { 0: 1, 1000000000: 698611116, 320000000: 30977140, 820000000: 629786193, 740000000: 375297772, 470000000: 909210595, 200000000: 933245637, 940000000: 83868974, 400000000: 429277690, 130000000: 623534362, 870000000: 256473217, 600000000: 724464507, 330000000: 522049725, 60000000: 27368307, 800000000: 203191898, 530000000: 256141983, 260000000: 135498044, 730000000: 663307737, 460000000: 275105629, 190000000: 109838563, 930000000: 778983779, 660000000: 769795511, 390000000: 917084264, 120000000: 661224977, 860000000: 116667533, 10000000: 682498929, 590000000: 131772368, 50000000: 67347853, 790000000: 748510389, 520000000: 608823837, 250000000: 112390913, 990000000: 847549272, 720000000: 852304035, 450000000: 462639908, 180000000: 547665832, 920000000: 193781724, 650000000: 92255682, 380000000: 940567523, 110000000: 281863274, 850000000: 823845496, 580000000: 848924691, 310000000: 128487469, 40000000: 723816384, 780000000: 624500515, 510000000: 97830135, 240000000: 136026497, 980000000: 377329025, 710000000: 435887178, 440000000: 780072518, 170000000: 66404266, 20000000: 491101308, 670000000: 373745190, 910000000: 172114298, 640000000: 903466878, 370000000: 148528617, 100000000: 927880474, 840000000: 814362881, 570000000: 811575797, 300000000: 668123525, 30000000: 76479948, 770000000: 671734977, 500000000: 733333339, 230000000: 268838846, 970000000: 492741665, 700000000: 957939114, 430000000: 568392357, 160000000: 195888993, 900000000: 586445753, 630000000: 456152084, 360000000: 189239124, 90000000: 888050723, 830000000: 672850561, 560000000: 637939935, 290000000: 500780548, 760000000: 624148346, 490000000: 703397904, 220000000: 368925948, 270000000: 217544623, 960000000: 965785236, 690000000: 825871994, 420000000: 358655417, 150000000: 261384175, 890000000: 245795606, 620000000: 326159309, 350000000: 386027524, 80000000: 199888908, 550000000: 696628828, 280000000: 419363534, 750000000: 217598709, 480000000: 99199382, 210000000: 724691727, 950000000: 315103615, 680000000: 606241871, 410000000: 996164327, 140000000: 970055531, 880000000: 627655552, 610000000: 272814771, 340000000: 309058615, 70000000: 625544428, 810000000: 423951674, 540000000: 141827977}
# ans = known[ N - N % int( 1e7 ) ]
# for i in range( N - N % int( 1e7 ) + 1, N + 1, 1 ):
# ans = ans * i % MOD
# return ans
n,a,b = get_nums_l()
nCa = nCk(n,a)
nCb = nCk(n,b)
ans = pow(2, n, MOD) - 1 - nCa - nCb
print(ans % (10**9 + 7))
| p02768 |
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
n, a, b = [int(x) for x in input().strip().split()]
mod = 10 ** 9 + 7
ans = pow(2, n, mod) - 1
fact = [1] * (b + 1)
for i in range(1, b+1):
fact[i] = (fact[i-1] * i) % mod
inv = [1] * (b + 1)
inv[-1] = pow(fact[-1], mod-2, mod)
for i in range(1, b):
inv[-1-i] = (inv[-1-i+1] * (b-(i-1))) % mod
def nCr(n, r):
ret = 1
for i in range(r):
ret = (ret * (n - i) % mod) % mod
return (ret * inv[r]) % mod
ans = (ans - nCr(n, a)) % mod
ans = (ans - nCr(n, b)) % mod
print(ans) | import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
n, a, b = [int(x) for x in input().strip().split()]
mod = 10 ** 9 + 7
ans = pow(2, n, mod) - 1
num = 1
den = 1
for i in range(a):
den = (den * (i+1)) % mod
num = (num * (n-i)) % mod
ans = (ans - (num * pow(den, mod-2, mod)) % mod ) % mod
for i in range(a, b):
den = (den * (i+1)) % mod
num = (num * (n-i)) % mod
ans = (ans - (num * pow(den, mod-2, mod)) % mod ) % mod
print(ans) | p02768 |
def cmb(n, r, mod):
c=1
for i in range(1, r+1):
c = (c * (n-i+1) * pow(i, mod-2, mod)) % mod
return c
n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
print(((pow(2, n, MOD) - cmb(n, a, MOD) - cmb(n, b, MOD) - 1) % MOD)) | class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
if n >= self.mod:
return 0
self._make(n)
return self._factorial[n]
def _make(self, n):
if n >= self.mod:
n = self.mod
if self._size < n+1:
for i in range(self._size, n+1):
self._factorial.append(self._factorial[i-1]*i % self.mod)
self._size = n+1
def fact_inv(self, n):
''' n!^-1 % mod '''
if n >= self.mod:
raise ValueError('Modinv is not exist! arg={}'.format(n))
self._make(n)
if self._size_inv < n+1:
self._factorial_inv += [-1] * (n+1-self._size_inv)
self._size_inv = n+1
if self._factorial_inv[n] == -1:
self._factorial_inv[n] = self.modinv(self._factorial[n])
return self._factorial_inv[n]
@staticmethod
def xgcd(a, b):
'''
Return (gcd(a, b), x, y) such that a*x + b*y = gcd(a, b)
'''
x0, x1, y0, y1 = 0, 1, 1, 0
while a != 0:
(q, a), b = divmod(b, a), a
y0, y1 = y1, y0 - q * y1
x0, x1 = x1, x0 - q * x1
return b, x0, y0
def modinv(self, n):
g, x, _ = self.xgcd(n, self.mod)
if g != 1:
raise ValueError('Modinv is not exist! arg={}'.format(n))
return x % self.mod
def comb(self, n, r):
''' nCr % mod '''
if r > n:
return 0
t = self(n)*self.fact_inv(n-r) % self.mod
return t*self.fact_inv(r) % self.mod
def comb_(self, n, r):
'''
nCr % mod
when r is not large and n is too large
'''
c = 1
for i in range(1, r+1):
c *= (n-i+1) * self.modinv(i)
c %= self.mod
return c
def comb_with_repetition(self, n, r):
''' nHr % mod '''
t = self(n+r-1)*self.fact_inv(n-1) % self.mod
return t*self.fact_inv(r) % self.mod
def perm(self, n, r):
''' nPr % mod '''
if r > n:
return 0
return self(n)*self.fact_inv(n-r) % self.mod
mod = 10**9 + 7
n, a, b = list(map(int, input().split()))
comb = Factorial().comb_
print(((pow(2, n, mod) - comb(n, a) - comb(n, b) - 1) % mod)) | p02768 |
from math import factorial
def modpow(a, n, p):
if n == 0:
return 1
elif n == 1:
return a % p
if n % 2 == 1:
return (a * modpow(a, n-1, p)) % p
tmp = modpow(a, n//2, p)
return (tmp * tmp) % p
def main():
mod = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
# まずは繰り返し2乗法によって全部の組み合わせを求める
# すべての組み合わせは、花を選ぶ/選ばないで組み合わせを決めれる
ans = (modpow(2, n, mod) - 1) % mod
# a本選んだときの数を引く
c_a = 1
for i in range(n, n-a, -1):
c_a *= i
c_a %= mod
c_a *= modpow(factorial(a), mod-2, mod)
ans -= c_a
ans %= mod
# b本選んだときの数を引く
c_b = 1
for i in range(n, n-b, -1):
c_b *= i
c_b %= mod
c_b *= modpow(factorial(b), mod-2, mod)
ans -= c_b
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| def modpow(a, n, p):
if n == 0:
return 1
elif n == 1:
return a % p
if n % 2 == 1:
return (a * modpow(a, n-1, p)) % p
tmp = modpow(a, n//2, p)
return (tmp * tmp) % p
def modfactrial(a, p):
ret = 1
for i in range(a, 1, -1):
ret = ret * i % p
return ret
def main():
mod = 10 ** 9 + 7
n, a, b = list(map(int, input().split()))
# まずは繰り返し2乗法によって全部の組み合わせを求める
# すべての組み合わせは、花を選ぶ/選ばないで組み合わせを決めれる
ans = (modpow(2, n, mod) - 1) % mod
# a本選んだときの数を引く
c_a = 1
for i in range(n, n-a, -1):
c_a *= i
c_a %= mod
c_a *= modpow(modfactrial(a, mod), mod-2, mod)
ans -= c_a
ans %= mod
# b本選んだときの数を引く
c_b = 1
for i in range(n, n-b, -1):
c_b *= i
c_b %= mod
c_b *= modpow(modfactrial(b, mod), mod-2, mod)
ans -= c_b
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| p02768 |
import itertools
import math
n,a,b = list(map(int,input().split()))
mod = 10**9+7
def comb(n, r):
ans = 1
for i in range(r):
ans = ans * (n-i) * pow(i+1, mod-2, mod) % mod
return ans
print(((pow(2, n, mod)-1-comb(n,a)-comb(n,b)) % mod))
|
n,a,b = list(map(int,input().split()))
mod = 10**9+7
def comb(n,r):
u = 1
d = 1
for i in range(n-r+1,n+1):
u = u*i%mod
for i in range(1,r+1):
d = d*i%mod
D = pow(d,mod-2,mod)
return u*D%mod
ans = pow(2,n,mod)-1-comb(n,a)-comb(n,b)
print((ans%mod)) | p02768 |
n,a,b = list(map(int,input().split()))
mod = 10**9+7
def comb(n,r):
u = 1
d = 1
for i in range(n-r+1,n+1):
u = u*i%mod
for i in range(1,r+1):
d = d*i%mod
D = pow(d,mod-2,mod)
return u*D%mod
ans = pow(2,n,mod)-1-comb(n,a)-comb(n,b)
print((ans%mod)) | n,a,b = list(map(int,input().split()))
p = 10**9 + 7
def comb(n,r):
bunshi = 1
for i in range(n-r+1,n+1):
bunshi = bunshi * i % p
bunbo = 1
for i in range(1,r+1):
bunbo = bunbo * i % p
return bunshi * pow(bunbo,p-2,p)
s = -1 + pow(2,n,p) - comb(n,a) -comb(n,b)
print((s%p))
| p02768 |
N, A, B = list(map(int, input().split()))
MAX = max(A, B) + 1
MOD = 1000000007
nCk = [0] * MAX
nCk[0] = 0
nCk[1] = N
def mod_pow(a, n, m):
res = 1
while n != 0:
if n & 1:
res = (res * a) % m
n = n >> 1
a = (a * a) % m
return res
def mod_inv(a, m):
b = m
u = 1
v = 0
while b:
t = a // b
a -= t * b
a, b = b, a
u -= t * v
u, v = v, u
u %= m
if u < 0:
u += m
return u
for i in range(2, MAX):
nCk[i] = (nCk[i-1] * ((N-i+1) * mod_inv(i, MOD))) % MOD
count = (mod_pow(2, N, MOD) - 1 - nCk[A] - nCk[B]) % MOD
print((int(count)))
| N, A, B = list(map(int, input().split()))
MAX = max(A, B) + 1
MOD = 1000000007
nCk = [0] * MAX
nCk[0] = 0
nCk[1] = N
inv = [0] * MAX
inv[1] = 1
for i in range(2, MAX):
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
nCk[i] = (nCk[i - 1] * (N - i + 1) * inv[i]) % MOD
count = (pow(2, N, MOD) - 1 - nCk[A] - nCk[B]) % MOD
print((int(count)))
| p02768 |
N, A, B = list(map(int, input().split()))
class remainder():
def __init__(self, mod=(10**9 + 7)):
self.mod = mod
def sub(self, a, b):
return (a + self.mod - b) % self.mod
def mul(self, a, b):
return ((a % self.mod) * (b % self.mod)) % self.mod
def pow(self, a, b):
bp = []
#bp.append(1)
bp.append(a)
n = len(bin(b)) - 2
for x in range(n):
bp.append(bp[x]**2 % self.mod)
res = 1
for x in range(n):
if b >> x & 1:
res = (res * bp[x]) % self.mod
return res
def div(self, a, b):
return self.mul(a, self.pow(b, self.mod - 2))
com = [0] * (B + 1)
com[0] = 1
re = remainder()
ans = re.pow(2, N) - 1
for x in range(1, B + 1):
s = re.sub(N, x) + 1
d = re.div(s, x)
com[x] = re.mul(com[x - 1], d)
subA = com[A]
subB = com[B]
ans = re.sub(ans, subA)
ans = re.sub(ans, subB)
print(ans)
| N, A, B = list(map(int, input().split()))
class remainder():
def __init__(self, mod=(10**9 + 7)):
self.mod = mod
def sub(self, a, b):
return (a + self.mod - b) % self.mod
def mul(self, a, b):
return ((a % self.mod) * (b % self.mod)) % self.mod
def pow(self, a, b):
bp = []
#bp.append(1)
bp.append(a)
n = len(bin(b)) - 2
for x in range(n):
bp.append(bp[x]**2 % self.mod)
res = 1
for x in range(n):
if b >> x & 1:
#res = re.mul(res, bp[x])
res = (res * bp[x]) % self.mod
return res
def div(self, a, b):
return self.mul(a, self.pow(b, self.mod - 2))
com = [0] * (B + 1)
com[0] = 1
re = remainder()
ans = re.pow(2, N) - 1
for x in range(1, B + 1):
s = re.sub(N, x) + 1
d = re.div(s, x)
com[x] = re.mul(com[x - 1], d)
subA = com[A]
subB = com[B]
ans = re.sub(ans, subA)
ans = re.sub(ans, subB)
print(ans)
| p02768 |
def binom(n, r, mod):
if n < r or n < 0 or r < 0: return 0
if n - r < r: r = n - r
if r == 0: return 1
elif r == 1: return n
numerator = [(n - r + 1 + k) % mod for k in range(r)] # (n-r+1)*(n-r+2)*...*(n-1)*n
denominator = [1 + k for k in range(r)] # 1*2*...*(r-1)*r
X = 1; Y = 1
for k in range(r):
X = (X * ((n - r + 1 + k) % mod)) % mod
Y = (Y * ((1 + k) % mod)) % mod
return X * pow(Y, mod-2, mod)
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
ans = (pow(2, n, MOD) - 1 - ((binom(n, a, MOD) + binom(n, b, MOD)) % MOD)) % MOD
print(ans) | def binom(n, r, mod):
if n < r or n < 0 or r < 0: return 0
if n - r < r: r = n - r
if r == 0: return 1
elif r == 1: return n
X = 1; Y = 1
for k in range(r):
X = (X * ((n - r + 1 + k) % mod)) % mod
Y = (Y * ((1 + k) % mod)) % mod
return X * pow(Y, mod-2, mod)
MOD = 10**9 + 7
n, a, b = list(map(int, input().split()))
ans = (pow(2, n, MOD) - 1 - ((binom(n, a, MOD) + binom(n, b, MOD)) % MOD)) % MOD
print(ans) | p02768 |
n,a,b=list(map(int,input().split()))
mod=10**9+7
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 = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1,r,p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
result%=mod
return result
allp=pow(2,n,mod)-1
ans=(allp-cmb(n,a)%mod-cmb(n,b)%mod+mod)%mod
if n==2:
ans=0
print(ans) | n,a,b=list(map(int,input().split()))
mod=10**9+7
def cmb(n, r,mod):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
#X//Y
X=1
Y=1
for i in range(r):
X*=(n-i)
X%=mod
Y*=(i+1)
Y%=mod
inv=pow(Y,mod-2,mod)
return (X*inv)%mod
allp=pow(2,n,mod)-1
ans=(allp-cmb(n,a,mod)-cmb(n,b,mod))%mod
if n==2:
ans=0
print(ans) | p02768 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.