input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(10**7)
import math
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]
... | import sys
sys.setrecursionlimit(10**7)
import math
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
X, Y = list(map(int, input().split()))
x = (-X+2*Y)/3
y = (2*X-Y)/3
if x.is_integer() and y.is_integer() and x>=0 and y>=0:
x =... | p02862 |
mod = int(1e9 + 7)
def powmod(a, b):
ans = 1
while(b):
if(b&1): ans = ans*a%mod
a = a*a%mod
b >>= 1
return ans
x, y = list(map(int,input().split()))
if(2*x < y or 2*y < x or (2*x-y)%3 or (2*y-x)%3): print((0))
else:
x, y = (2*x-y)//3, (2*y-x)//3
#print(x,y)
f... | mod = int(1e9 + 7)
x, y = list(map(int,input().split()))
if(2*x < y or 2*y < x or (2*x-y)%3 or (2*y-x)%3): print((0))
else:
x, y = (2*x-y)//3, (2*y-x)//3
#print(x,y)
fac = [0 for i in range(x+y+1)]
fac[0] = 1
for i in range(1,x+y+1):
fac[i] = fac[i-1]*i%mod
ans = fac[x+y]*pow(f... | p02862 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
#modに対応して高速なコンビネーションが求められる
# 階乗 & 逆元計算
n = 10 ** 6
factorial = [1]
inverse = [1]
for i in range(1, n+2):
factorial.append(... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
#modに対応して高速なコンビネーションが求められる
# 階乗 & 逆元計算
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
... | p02862 |
x,y=list(map(int,input().split()))
if (2*x-y)%3!=0 or (2*x-y)<0:
print((0))
exit()
if (2*y-x)%3!=0 or (2*y-x)<0:
print((0))
exit()
p=int((2*x-y)/3)
q=int((2*y-x)/3)
M=2*(10**6)
Mod=10**9+7
fac=[0]*M
finv=[0]*M
inv=[0]*M
def COMinit():
fac[0]=fac[1]=1
finv[0]=finv[1]=1
inv[1]=1
fo... | x,y=list(map(int,input().split()))
if (2*x-y)%3!=0 or (2*x-y)<0:
print((0))
exit()
if (2*y-x)%3!=0 or (2*y-x)<0:
print((0))
exit()
p=int((2*x-y)/3)
q=int((2*y-x)/3)
M=p+q+2
Mod=10**9+7
fac=[0]*M
finv=[0]*M
inv=[0]*M
def COMinit():
fac[0]=fac[1]=1
finv[0]=finv[1]=1
inv[1]=1
for i ... | p02862 |
x, y = list(map(int, input().split()))
from operator import mul
from functools import reduce
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
if (x+y) % 3 != 0:
... | x, y = list(map(int, input().split()))
def cmb(n, r, mod):
from operator import mul
from functools import reduce
N = n + r
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod )
inv... | p02862 |
def make_tables(m):
fac=[1,1]
finv=[1,1]
inv=[0,1]
for i in range(2,m+1):
fac.append((fac[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
finv.append(finv[i-1]*inv[i]%mod)
return fac,finv
def calc_nCk(n,k,fac,finv):
if n<k or (n<0 or k<0):
return 0... | def nCk(n,k):
if n<k or (n<0 or k<0):
return 0
#k=min(k,n-k)
num,denum=1,1
for i in range(k):
num=num*(n-i)%mod
denum=denum*(i+1)%mod
return num*pow(denum,mod-2,mod)%mod
x,y=list(map(int,input().split()))
mod=10**9+7
n=(y-0.5*x)/1.5
if int(n)!=n:
print((0))... | p02862 |
#!/usr/bin/env python3
from functools import reduce
x, y = list(map(int, input().split()))
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, li... | #!/usr/bin/env python3
from functools import reduce
x, y = list(map(int, input().split()))
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, li... | p02862 |
LARGE = 10 ** 9 + 7
def solve(x, y):
if (x + y) % 3 != 0:
return 0
z = (x + y) // 3
if x < z or y < z:
return 0
# zC(x-z)
r = min(x - z, y - z)
res = 1
for i in range(r):
res *= z - i
res *= pow(i + 1, LARGE - 2, LARGE)
res %= LARGE
... | LARGE = 10 ** 9 + 7
def solve(x, y):
if (x + y) % 3 != 0:
return 0
z = (x + y) // 3
if x < z or y < z:
return 0
# zC(x-z)
r = min(x - z, y - z)
res = 1
for i in range(r):
res *= z - i
res *= pow(i + 1, LARGE - 2, LARGE)
res %= LARGE
... | p02862 |
x,y = list(map(int,input().split()))
if (x+y) % 3 != 0:
print((0))
elif x < 0 or y < 0:
print((0))
elif x/y > 2 or y/x > 2:
print((0))
else:
n = (x+y) // 3
m = x - n
mod = 10**9 + 7
def inv(x):
y = 1
while x != 1:
y *= mod//x + 1
y %= mod
x -= mod%x
return y
... | #17:23
x,y = list(map(int,input().split()))
if (x+y) % 3 != 0:
print((0))
elif x*2 < y or y*2 < x:
print((0))
else:
a = (x + y) // 3
b = y - a
mod = 10 ** 9 + 7
def inv(x):
y = 1
while x != 1:
y *= mod // x + 1
y %= mod
x -= mod % x
return y
ans = 1
for i ... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
N = 10**6 #出力の制限
mod = 10**9+7
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inver... | mod = 10 ** 9 + 7 # mod素数
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
X,Y=list(map(int,input().split()))
x,y = 2*X-Y, 2*Y-X
if x<0 or y<0 or x%3!=0 or y%3!=0:
ret=0
else:
x,y=x//3,y//3
nCrl = nCr(x+y, mi... | p02862 |
#coding:utf-8
import bisect
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def com(a, b, p):
if a < b or a < 0 or b < 0:
return 0
fac = [1]*(a+1)
inv = [1]*(a+1)
finv = [1]*(a+1)
for... | #coding:utf-8
import bisect
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = l... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
x,y = list(map(int,input().split()))
mod = 10**9+7
division = (x+y)//3
if (x+y)%3!=0:
print((0))
exit()
mod = 10**9+7
#combを求める前処理 O(log division)
g1 = [1, 1] #元テ... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
x,y = list(map(int,input().split()))
if (x+y)%3!=0:
print((0))
exit()
mod = 10**9+7
division = (x+y)//3
#combを求める前処理（階乗とその逆数）
g1 = [1, 1] #元テーブル
g2 = [1, 1] #逆元テーブル... | p02862 |
MOD=10**9+7
x , y = list(map(int, input().split()))
a=(2*x-y)//3
b=(2*y-x)//3
if 2*a+b!=x:
print((0))
exit()
factorial = [1]
inverse = [1]
n=a+b
r=a
for i in range(1, n+2):
factorial.append(factorial[-1] * i % MOD)
inverse.append(pow(factorial[-1], MOD - 2, MOD))
def combi(n, r):
... | N=10**9+7
x , y = list(map(int, input().split()))
a=(2*x-y)//3
b=(2*y-x)//3
if 2*a+b!=x:
print((0))
exit()
n=a+b
r=a
def fac(n,r,N):
ans=1
for i in range(r):
ans=ans*(n-i)%N
return ans
def combi(n,r,N):
if n<r or n<0 or r<0:
ans = 0
return ans
... | p02862 |
def solve(x, y):
if (x + y) % 3 != 0:
return 0
n = (x + y) // 3
r = min((2 * y - x) // 3, (2 * x - y) // 3)
return cmb(n, r, mod)
_x, _y = list(map(int, input().split()))
mod = 10 ** 9 + 7
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2... | def solve(x, y):
if (x + y) % 3 != 0:
return 0
n = (x + y) // 3
r = min((2 * y - x) // 3, (2 * x - y) // 3)
return cmb(n, r, mod)
_x, _y = list(map(int, input().split()))
mod = 10 ** 9 + 7
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2... | p02862 |
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def ... | # 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def ... | p02862 |
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def ... | # 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def ... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | def cmb1(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6+10
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
invers... | p02862 |
MOD=10**9+7
def powmod(a,p):
if p==0:
return 1
elif p==1:
return a
elif p%2==0:
powsq=powmod(a,p//2)
return (powsq**2)%MOD
elif p%2==1:
powsq=powmod(a,p//2)
return (a*powsq**2)%MOD
def invmod(a):
return powmod(a,MOD-2)
X,Y=list(map(int,input().split()))
if (X+Y)%... | MOD=10**9+7
X,Y=list(map(int,input().split()))
def powmod(a,p):
if p==0:
return 1
elif p==1:
return a
else:
pow2=powmod(a,p//2)
if p%2==0:
return (pow2**2)%MOD
else:
return (a*pow2**2)%MOD
def invmod(a):
return powmod(a,MOD-2)
def comb_mod(n,r):
nPr=1
fact_... | p02862 |
from functools import reduce
def modpow(a, m):
ret = 1
while m > 0:
if m & 1:
ret = ret * a % mod
a = a * a % mod
m = m >> 1
return ret
def modinv(a):
return modpow(a, mod - 2)
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
... | from functools import reduce
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
over = reduce(lambda a, b: a * b % mod, list(range(n, n - r, -1)))
under = reduce(lambda a, b: a * b % mod, list(range(1, r + 1)))
return over * pow(under, mod-2, mod) % mod
x, y = [int(i) for i in ... | p02862 |
def bigcmb(N, R, MOD): # nCr(mod p) #n>=10**7,r<=10**6 #前処理不要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
x, y = l... | def bigcmb(N, R, MOD): # nCr(mod p) #n>=10**7,r<=10**6 #前処理不要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
x, y = l... | p02862 |
def bigcmb(N, R, MOD): # nCr(mod p) #n>=10**7,r<=10**6 #前処理不要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
x, y = l... | def bigcmb(N, R, MOD): # nCr(mod p) #n>=10**7,r<=10**6 #前処理不要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
x, y = l... | p02862 |
MAX_NUM = 10**6 + 1
MOD = 10**9+7
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MO... | MAX_NUM = 10**6 + 1
MOD = 10**9+7
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MO... | p02862 |
#ABC145D
MOD = 10 ** 9 + 7
import math
x,y = list(map(int,input().split()))
a,b = -1,-1
for i in range(x+1):
m = 0
if (x-i) % 2 == 0:
m = (x-i) // 2
if 2*i + m == y:
if i >= 0 and m >= 0:
a = i
b = m
break
else:
... | #ABC145D
MOD = 10 ** 9 + 7
import math
x,y = list(map(int,input().split()))
a,b = -1,-1
for i in range(x+1):
m = 0
if (x-i) % 2 == 0:
m = (x-i) // 2
if 2*i + m == y:
if i >= 0 and m >= 0:
a = i
b = m
break
else:
... | p02862 |
import sys
from math import factorial
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9 + 7
x, y = list(map(int, sys.stdin.readline().split()))
if (x + y)%3 != 0:
print((0))
sys.exit()
if y < x/2 and y > 2... | import sys
from math import factorial
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9 + 7
x, y = list(map(int, sys.stdin.readline().split()))
if (x + y)%3 != 0:
print((0))
sys.exit()
if y < x/2 and y > 2*x:
... | p02862 |
# 2019-11-16 21:01:15(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
... | # 2019-11-16 21:01:15(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
... | p02862 |
X, Y = list(map(int, input().split()))
def mod_Combination(n, k, mod):
def ext_gcd(a, b):
if b == 0:
return a, 1, 0
else:
d,x,y = ext_gcd(b,a%b)
x-=(a//b)*y
return d,y,x
p,q=1,1
for i in range(n-k+1, n+1):
p=(p*i)%mod
for... | X, Y = list(map(int, input().split()))
def mod_Combination(n, k, mod):
def ext_gcd(a, b):
if b == 0:
return a, 1, 0
else:
d,x,y = ext_gcd(b,a%b)
x-=(a//b)*y
return d,y,x
p,q=1,1
for i in range(n-k+1, n+1):
p=(p*i)%mod
for... | p02862 |
# nCk(mod p)の計算
from math import factorial
X, Y = list(map(int, input().split()))
MOD = 10**9+7
MAX = 10**6+1
# a!のテーブルfact
fact = [0] * MAX
# (a!)^-1のテーブルfinv
finv = [0] * MAX
def comb_init():
# a!と(a!)^-1のテーブルを作る
# 累積積のイメージ
fact[0] = fact[1] = 1
finv[0] = finv[1] = 1
for i in ra... | X, Y = list(map(int, input().split()))
MOD = 10**9+7
MAX = 10**6+1
# a!のテーブルfact
fact = [0] * MAX
def comb_init():
# 累積積のイメージ
fact[0] = fact[1] = 1
for i in range(2, MAX):
fact[i] = i * fact[i-1] % MOD
def comb(n, r):
return fact[n]*pow(fact[r], -1, MOD)*pow(fact[n-r], -1, MOD)... | p02862 |
mod = 10 ** 9 + 7
x, y = list(map(int, input().split()))
a = (2 * y - x) // 3
b = (2 * x - y) // 3
if (x + y) % 3 != 0 or a < 0 or b < 0:
print((0))
exit()
n = a + b
r = min(a, b)
ans = 1
for i in range(r):
ans = ans * (n - i) * pow(i + 1, mod - 2, mod) % mod
print(ans)
| def factorial(n, r, p):
ret = 1
for i in range(n, n - r, -1):
ret = (ret * i) % p
return ret
def comb(n, r, p):
r = min(r, n - r)
return (factorial(n, r, p) * pow(factorial(r, r, p), p - 2, p)) % p
mod = 10 ** 9 + 7
x, y = list(map(int, input().split()))
a = (2 * y - x) // ... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
if (X + Y) % 3 != 0:
print((0))
exit()
if abs(X - Y) > (X + Y) // 3:
print((0))
exit()
n = (X + Y) // 3 + 1
k = ((X - Y) + n + 1) // 2
SIZE = max(n, k)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] ... | p02862 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
... | p02862 |
def main():
X, Y = (int(i) for i in input().split())
fac = [0] * max(X, Y)
finv = [0] * max(X, Y)
inv = [0] * max(X, Y)
MOD = (10**9) + 7
def COMinit(m):
fac[0] = 1
finv[0] = 1
if m > 1:
fac[1] = 1
finv[1] = 1
inv[1] = 1
... | def main():
X, Y = (int(i) for i in input().split())
if (X+Y) % 3 != 0:
return print(0)
m = (X + Y)//3 + 3
fac = [0] * m
finv = [0] * m
inv = [0] * m
MOD = 10**9 + 7
def COMBinitialize(m):
fac[0] = 1
finv[0] = 1
if m > 1:
fac[1] ... | p02862 |
import math
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
... | def cmb(n,r,mod):
bunshi=1
bunbo=1
for i in range(r):
bunbo = bunbo*(i+1)%mod
bunshi = bunshi*(n-i)%mod
return (bunshi*pow(bunbo,mod-2,mod))%mod
mod = 10**9+7
x,y = list(map(int,input().split()))
sum = 0
if x%2 == 1:
for k in range((x+1)//2):
k = 2*k +1
l = (x-k)//2
if l+2*k ... | p02862 |
from math import factorial
def com(n,k,mod,fac,infac):
k=min(k,n-k)
return fac[n]*infac[k]*infac[n-k]%mod
def cominit(mod,n):
fac=[1,1]
infac=[1,1]
inv=[0,1]
for i in range(2,n+1):
fac.append(fac[-1]*i%mod)
inv.append(-inv[mod%i]*(mod//i)%mod)
infac.append(... | # nCkの計算するやつ
# (n!)/(k!(n-k)!) mod p
# (n!) * (k!)^-1 * ((n-k)!)^-1 mod p
def comInit(MOD, n):
fact=[1,1] # fact[n]はnの階乗
invr=[0,1] # invr[n]はnの逆元
invr_fact=[1,1] # invr_fact[n]は逆元の階乗
for i in range(2,n+1):
fact.append(fact[-1]*i%MOD)
invr.append(-invr[MOD%i]*(MOD//i)%MOD)
... | p02862 |
from sys import exit
def mpow(x, n):
result = 1
while n != 0:
if n & 1 == 1:
result *= x
result %= 1000000007
x *= x
x %= 1000000007
n >>= 1
return result
p = 1000000007
X, Y = list(map(int, input().split()))
if (X+Y) % 3 != 0:... | from sys import exit
def mpow(x, n):
result = 1
while n != 0:
if n & 1 == 1:
result *= x
result %= 1000000007
x *= x
x %= 1000000007
n >>= 1
return result
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or... | p02862 |
# フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
n = a + b
fac = [0] * (n + 1)
fac[0] = 1
for i in range(n):
fac[i + 1] = fac[i] * (i + 1) %... | # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
def make_factorial_table(n):
result = [0] * (n + 1)
result[0] = 1
for i in range(1, n + 1):
result[i] = result[i - 1] * i % m
return result
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n... | p02862 |
# フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
def make_factorial_table(n):
result = [0] * (n + 1)
result[0] = 1
for i in range(1, n + 1):
result[i] = result[i - 1] * i % m
return result
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n... | # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= m
b *= i + 1
b %= m
return a * pow(b, m - 2, m) % m
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b ... | p02862 |
import math
P = 10**9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 > 0:
print((0))
exit()
n = (X + Y) // 3
x = X - n
y = Y - n
if 0 > x or 0 > y:
print((0))
exit()
fact = [0] * (x + y + 1)
inv = [0] * (x + y + 1)
fact_inv = [0] * (x + y + 1)
fact[0], fact[1] = 1, 1
inv[0],... | P = 10**9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 > 0:
print((0))
exit()
n = (X + Y) // 3
x = X - n
y = Y - n
if 0 > x or 0 > y:
print((0))
exit()
fact = [0] * (x + y + 1)
inv = [0] * (x + y + 1)
fact_inv = [0] * (x + y + 1)
fact[0], fact[1] = 1, 1
inv[0], inv[1] = 0, 1
... | p02862 |
P = 10**9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 > 0:
print((0))
exit()
n = (X + Y) // 3
x = X - n
y = Y - n
if 0 > x or 0 > y:
print((0))
exit()
fact = [0] * (x + y + 1)
inv = [0] * (x + y + 1)
fact_inv = [0] * (x + y + 1)
fact[0], fact[1] = 1, 1
inv[0], inv[1] = 0, 1
... | def fact(n, k, mod):
res = 1
for i in range(k):
res = res * (n - i) % mod
return res
def c(x, y, mod):
y = min(x, x - y)
return (fact(x, y, mod) * pow(fact(y, y, mod), mod - 2 , mod)) % mod
P = 10**9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 > 0:
print((0))... | p02862 |
# https://atcoder.jp/contests/abc145/tasks/abc145_d
class Combination: # 計算量は O(n_max + log(mod))
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1): # 階乗(= n_... | # https://atcoder.jp/contests/abc145/tasks/abc145_d
X, Y = list(map(int, input().split()))
if (2*Y- X) % 3 or (2*X- Y) % 3:
print((0))
exit()
x = (2*Y - X) // 3
y = (2*X - Y) // 3
if x < 0 or y < 0:
print((0))
exit()
n = x + y
r = x
mod = 10**9 + 7
f = 1
for i in range(1, n... | p02862 |
# https://atcoder.jp/contests/abc145/tasks/abc145_d
X, Y = list(map(int, input().split()))
if (2*Y- X) % 3 or (2*X- Y) % 3:
print((0))
exit()
x = (2*Y - X) // 3
y = (2*X - Y) // 3
if x < 0 or y < 0:
print((0))
exit()
n = x + y
r = x
mod = 10**9 + 7
f = 1
for i in range(1, n... | from functools import reduce
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(denomina... | p02862 |
import sys
import math
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:
offse... | x,y=list(map(int,input().split()))
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:
... | p02862 |
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
mod = 10 ** 9 + 7 # 出力の制限
N = 10 ** 6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mo... | def nCr(n,r,mod = 10**9+7):
r = min(n-r,r)
numer = denom = 1
for i in range(1,r+1):
numer = numer * (n+1-i) %mod
denom = denom * i % mod
return numer * pow(denom,mod-2,mod) %mod
x, y = list(map(int, input().split()))
if (x+y) % 3 != 0:
print((0))
exit()
count... | p02862 |
#lにa回、rにb回進む
x,y = list(map(int,input().split()))
#x = a +2b
#y = 2a+b
#x+y = 3a+3b
#a+b = (x+y)/3
#b=x-a+b
b = x-(x+y)/3
a = (x-2*b)
ans = 0
#print("a:{} b:{}".format(a,b))
if a<0 or b<0 or b-int(b)>0.00001 or a-int(a)>0.00001:
print(ans)
exit()
MAX = 1000000;
MOD = 1000000007;
fac = [0 for i... | #lにa回、rにb回進む
x,y = list(map(int,input().split()))
#x = a +2b
#y = 2a+b
#x+y = 3a+3b
#a+b = (x+y)/3
#b=x-a+b
b = x-(x+y)/3
a = (x-2*b)
ans = 0
#print("a:{} b:{}".format(a,b))
if a<0 or b<0 or b-int(b)>0.00001 or a-int(a)>0.00001:
print(ans)
exit()
MAX = int(a+b)+1
MOD = 1000000007
fac = [0 for i ... | p02862 |
from sys import stdin, setrecursionlimit
def initialize_cmb(m, mod=10 ** 9 + 7):
fac = [1]
finv = [1]
inv = [0] * (m + 1)
if m >= 1:
fac.append(1)
finv.append(1)
inv[1] = 1
pre_fac = 1
pre_finv = 1
for i in range(2, m + 1):
pre_... | from sys import stdin, setrecursionlimit
def cmb(n, r, mod=10 ** 9 + 7):
r = min(r, n - r)
x = y = 1
for i in range(r):
x *= n - i
x %= mod
y *= i + 1
y %= mod
return x * pow(y, mod - 2, mod) % mod
def main():
mod = 10 ** 9 + 7
input = stdin.bu... | p02862 |
X, Y = list(map(int, input().split()))
mod = 10**9 + 7
if (X + Y) % 3 != 0 or X > 2*Y or Y > 2*X:
print((0))
else:
n2x = (2*X - Y) // 3
n1x = (2*Y - X) // 3
n = n2x + n1x
# nCn2xを求める
def combs(n,n2x):
invs = [1] * (n+1)
nfac = 1
for i in range(1, n+1):
... | X, Y = list(map(int, input().split()))
mod = 10**9 + 7
if (X + Y) % 3 != 0 or X > 2*Y or Y > 2*X:
print((0))
else:
n2x = (2*X - Y) // 3
n1x = (2*Y - X) // 3
n = n2x + n1x
# nCn2xを求める
def combs(n,n2x,mod):
facs = [1] * (n+1)
# invs = [1] * (n+1)
nfac = 1
... | p02862 |
X,Y=list(map(int,input().split()))
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)... | def com(n,r,m):
f=[1,1]
for i in range(2,n+1):
f.append(f[i-1]*i%m)
return f[n]*pow(f[r]*f[n-r]%m,m-2,m)%m
mod=10**9+7
x,y=list(map(int,input().split()))
z=(x+y)//3
if (x+y)%3 or abs(x-y)>z:
ans=0
else:
ans=com(z,x-z,mod)
print(ans) | p02862 |
import sys
input = sys.stdin.readline
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
... | import sys
input = sys.stdin.readline
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
x,y=list(map(int,input().split()))
if (2*y-x)%3==0:
a=(2*y-x)//3
b=(2*x-y)//3
mod = 10**9+7 #出力の制限
N = a+b
r=min(a,b)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テ... | def cmb(n,r,mod):
r=min(r,n-r)
if r==0:
return 1
elif r<0:
return 0
else:
X=1
Y=1
for i in range(r):
X*=n-i
X%=mod
Y*=i+1
Y%=mod
Y=pow(Y,mod-2,mod)
X*=Y
return X%mod
if __na... | p02862 |
x, y = list(map(int, input().split()))
if (x + y)%3 != 0:
print((0))
else:
k = (x + y)//3
if k <= x <= 2*k:
MOD = 10**9 + 7
fac = [0]*(k + 1)
finv = [0]*(k + 1)
inv = [0]*(k + 1)
fac[0] = 1; fac[1] = 1; finv[0] =1; finv[1] = 1; inv[1] = 1
for i in r... | # 拡張ユークリッド互除法を用いて逆元を求める
def modinv(a, m):
b = m; x0 = 1; x1 = 0
while b:
q = a//b
a, b = b, a%b
x0, x1 = x1, x0 - q*x1
return x0%m
x, y = list(map(int, input().split()))
if (x + y)%3 != 0:
print((0))
else:
k = (x + y)//3
if k <= x <= 2*k:
i = mi... | p02862 |
# D - Knight
X, Y = list(map(int, input().split()))
####
a = (2*Y - X) / 3
b = (2*X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] % mod * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N... | # D - Knight
X, Y = list(map(int, input().split()))
####
a = (2*Y - X) / 3
b = (2*X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
# を一部修正
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] % mod * g2[n-r] % mod
mod = 10**9+7 ... | p02862 |
mod = 10**9+7
def pow(n, x):
if x == 0:
return 1
elif x % 2 == 0:
return pow(n * n % mod, x // 2)
else:
return n * pow(n * n % mod, x // 2) % mod
def comb(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
x, y... | mod = 10**9+7
def comb(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
x, y = list(map(int, input().split()))
m = abs(x - y)
n = (x + y) // 3
if (x + y) % 3 == 0 and n >= m:
print((comb(n, (n - m) // 2)))
else:
print((0... | p02862 |
X,Y=list(map(int,input().split()))
import sys
if (2*Y-X)%3!=0 or (2*X-Y)%3!=0:
print((0))
sys.exit()
if (2*Y-X)<0 or (2*X-Y)<0:
print((0))
sys.exit()
x=(2*Y-X)//3
y=(2*X-Y)//3
#(x+y)Cxを求める
fac=[0 for i in range(x+y+1)]
inv=[0 for i in range(x+y+1)]
finv=[0 for i in range(x+y+1)]
#初期条件
p=1000000... | #(i,j)→（i+1,j+2）をx回、(i,j)→（i+2,j+1）がy回あるとすると
#x=(2Y-X)//3,y=(2X-Y)//3、となる
#これが整数or非負なら(x+y)Cxを求めればいい
X,Y=list(map(int,input().split()))
import sys
if (2*Y-X)%3!=0 or (2*X-Y)%3!=0:
print((0))
sys.exit()
if (2*Y-X)<0 or (2*X-Y)<0:
print((0))
sys.exit()
#それ以外なら存在する
x=(2*Y-X)//3
y=(2*X-Y)//3
#... | p02862 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def modfact(n):
fact=[1]*(n+1)
invfact=[1]*(n+1)
for i in range(1,n+1):
fact[i]=i*fact[i-1]%MOD
invfact[n]=pow(fact[n],MOD-2,MOD)
for i in range(n-1,-1,-1):
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
class modfact(object):
def __init__(self,n):
fact=[1]*(n+1)
invfact=[1]*(n+1)
for i in range(1,n+1):
fact[i]=i*fact[i-1]%MOD
invfact[n]=pow(f... | p02862 |
[x,y]=list(map(int,input().split()))
if ((x%3)+(y%3))%3!=0:
print((0))
else:
n=int((x+y)/3)
r=y-n
if r<0 or r>n:
print((0))
else:
if r>n-r:
r=n-r
mod=1000000007
kaijo=[1]
for i in range(1,n+1):
kaijo.append(kaijo[-1]*i%mod) #これで、kaijo[i]=i!となる。
gyakugen=[pow(kaijo[n-r],mod-2,mod)]
... | [x,y]=list(map(int,input().split()))
#nCrのmodを求める
def nCrmod(n,r,mod):
if r<0 or r>n:
ans=0
else:
if r>n-r:
r=n-r
kaijo=[1] #階乗リスト作成
for i in range(1,n+1):
kaijo.append(kaijo[-1]*i%mod) #これで、kaijo[i]≡i!となる。
gyakugen=[pow(kaijo[n-r],mod-2,mod)] #逆限リスト作成
for i in reversed(list(range(1,n-... | p02862 |
X,Y = list(map(int, input().split()))
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = ... | X,Y = list(map(int, input().split()))
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = ... | p02862 |
x, y = list(map(int, input().split()))
MOD = int(1.0e+9 + 7)
DP_max = 3333334
DP = []
X = int((2 * y - x) / 3)
Y = int((2 * x - y) / 3)
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6... | x, y = list(map(int, input().split()))
def cmb(n, r, mod):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % mod
X = int((2 * y - x) / 3)
Y = int((2 * x - y) / 3)
MOD = int(1.0e+9 + 7)
N = int(7.0e+5) # N は必要分だけ用意する
fact = [1, 1] # fact[n... | p02862 |
import math
a,b=list(map(int,input().split()))
x=max(a,b)
y=min(a,b)
p=abs(x-y)
P = 10**9 + 7
N = 1000000
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
if (x+y)%3!=0:
print((0))
elif x>y*2:
print((0))
else:
n=(x+y)//3
q=(2*x-y)//3
r=(2*y-x... | import math
a,b=list(map(int,input().split()))
x=max(a,b)
y=min(a,b)
p=abs(x-y)
if (x+y)%3!=0:
print((0))
elif x>y*2:
print((0))
else:
n=(x+y)//3
q=(2*x-y)//3
r=(2*y-x)//3
#print(math.factorial(q+r)//math.factorial(q)//math.factorial(r)%(10**9+7))
ans=1
qq=1
r... | p02862 |
import sys
input = sys.stdin.readline
MOD = 1000000007
def comb_mod(n, r, mod):
if n < r:
return 0
elif n < 0 or r < 0:
return 0
else:
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fac.append(fac[-1] * i % mod)
... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
class CmbMod:
def __init__(self, n, p):
"""
二項係数nCr(n個の区別できるものからr個のものを選ぶ組み合わせの数)をpで割った余りを求める
"""
self.n = n
self.p = p
self.fact = [1, 1]
... | p02862 |
import math
X,Y = list(map(int,input().split()))
a,b = (2*Y-X)/3,(2*X-Y)/3
n = 10**9+7
nCr={}
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):... | import math
X,Y = list(map(int,input().split()))
a,b = (2*Y-X)/3,(2*X-Y)/3
n = 10**9+7
def cmb(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod... | p02862 |
def comb(n, k, MOD):
if n < k or n < 0 or k < 0:
return 0
k = min(k, n - k)
if k == 0:
return 1
iinv = [1] * (k + 1)
ans = n
for i in range(2, k + 1):
iinv[i] = MOD - iinv[MOD % i] * (MOD // i) % MOD
ans *= (n + 1 - i) * iinv[i] % MOD
ans %= MOD... | # https://www.geeksforgeeks.org/compute-ncr-p-set-3-using-fermat-little-theorem/
def comb(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den, p - 2, p)) % p
m = 10**9 + 7
x, y = (int(x) for x in input().spli... | p02862 |
X,Y=list(map(int,input().split()))
if (X+Y)%3!=0:
print((0))
exit()
A=int((X+Y)/3)
B=int((2*Y-X)/3)
if A<0 or B<0:
print((0))
exit()
MOD=10**9+7
def comb(n,k):
tmp=1
for i in range(n-k+1,n+1):
tmp*=i
tmp%=MOD
for i in range(1,k+1):
tmp*=pow(i,MOD-2,MOD)
tmp%=MOD
return ... | #ika tako
def prepare(n, MOD):
f = 1
for m in range(1, n + 1):
f = f * m % MOD
#print(f)
fn = f#n!を求める
#print(fn)
#print(f)
inv = pow(f, MOD - 2, MOD)
#print(inv)
invs = [1] * (n + 1)#[1, 1, 1]のイメージ、逆元？格納テーブル
#print(invs) ⇒ [1, 1, 1]のイメージ、逆元格納テーブル
... | p02862 |
'''
Aは移動関数と同数：xとy方向に合計で3進んでいるから
Bは移動回数の内、(i+1,j+2)を選んだ回数：
1回でx方向には1進み、y方向には2進む
進み方は2通りしかないので、全体の内、1通りを選んだ回数を求めればOK
'''
X,Y=list(map(int,input().split()))
if (X+Y)%3!=0:#まず、条件に合わないケースを除外
print((0))
exit()
A=int((X+Y)/3)
B=int((2*Y-X)/3)
if A<0 or B<0:
print((0))
exit()
MOD=10**9+7
def comb(n,k):#... | #ika tako
'''
A.ダメなケースを除外できるか、B.組合せの数を問題に応じて求められるか
階乗や逆元はfor文で求める。
ダメなケースを除外した上で、最終X,Y に行くには、二つの選択肢
(i+1,j+2),(i+2,j+1)の組合せの数を求める。
組合せの数を求める時は、階乗と逆元を使う。
逆元は一通り、全て求めておいて、配列invsに格納して、後で使う。
'''
def prepare(n, MOD):
f = 1
for m in range(1, n + 1):
f = f * m % MOD
fn = f#n!を求める
inv = ... | p02862 |
MOD = 10 ** 9 + 7
def power_expo(x, y):
"""Returns x^y.
<https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6>
結局, 組み込み関数の `pow()` のほうが速そう. 第3引数でmodもできる.
"""
if y == 0:
return 1
elif y % 2 == 0:
return power_expo(x, y // 2) ** 2 % MOD
else:
return ... | MOD = 10 ** 9 + 7
def power_expo(x, y):
"""Returns x^y.
<https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6>
結局, 組み込み関数の `pow()` のほうが速そう. 第3引数でmodもできる.
"""
if y == 0:
return 1
elif y % 2 == 0:
return power_expo(x, y // 2) ** 2 % MOD
else:
return ... | p02862 |
import sys
mod=10**9+7
x,y=list(map(int,input().split()))
a=(-x+2*y)//3
b=(2*x-y)//3
if a<0 or b<0:
print((0))
sys.exit()
f=[1]
for i in range(1,a+b+1):
f.append(f[-1]*i%mod)
if a+2*b==x and 2*a+b==y:
print((f[a+b]*pow(f[a]*f[b],mod-2,mod)%mod))
else:
print((0)) | import sys
mod=10**9+7
x,y=list(map(int,input().split()))
a=(-x+2*y)//3
b=(2*x-y)//3
if a<0 or b<0:
print((0))
sys.exit()
f=[1]
for i in range(1,a+b+1):
f.append(f[-1]*i%mod)
if a+2*b==x and 2*a+b==y:
print((f[a+b]*pow(f[a],mod-2,mod)*pow(f[b],mod-2,mod)%mod))
else:
print((0)) | p02862 |
X,Y = list(map(int,input().split()))
if (X+Y)%3 != 0 or X > 2*Y or Y > 2*X:
print((0))
else:
ab = (X+Y)//3
a = X - ab
b = ab - a
mod = 10**9+7
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
... | X,Y = list(map(int,input().split()))
def comb(n,k,p):
"""power_funcを用いて(nCk) mod p を求める"""
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a = 1
b = 1
c = 1
for i in range(1,n+1):
a = (a*i)%p
for i in range(1,k+1):
b = (b*i)%p
for i in range(1... | p02862 |
X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def modpow(a, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * a % MOD
a = a * a % MOD
n >>= 1
return ret
def modinv(a):
return modpow(a, MOD - 2)
def modfac(x):
ret = 1
for i in range(... | X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def modpow(x, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * x % MOD
x = x * x % MOD
n >>= 1
return ret
def modinv(x):
return modpow(x, MOD - 2)
def modf(x):
ret = 1
for i in range(2,... | p02862 |
def solve():
mod = 10 ** 9 + 7
x, y = list(map(int, input().split()))
sum_ = x + y
q, r = divmod(sum_, 3)
if r != 0:
return 0
a = (x * 2 - y) // 3
b = (y * 2 - x) // 3
if a < 0 or b < 0:
return 0
def cmb(n, r):
return (fact[n] * finv_... | def main():
mod = 10 ** 9 + 7
def choose(n, a, mod=mod):
x, y = 1, 1
for i in range(a):
x = x * (n - i) % mod
y = y * (i + 1) % mod
return x * pow(y, mod - 2, mod) % mod
x, y = list(map(int, input().split()))
q, r = divmod(x + y, 3)
if ... | p02862 |
X,Y=list(map(int,input().split()))
mod=10**9+7
def nCr(n, r, mod):
r = min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n+1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod
if (X+Y)%3 != 0:
print((0))
exit()
... | X,Y=list(map(int,input().split()))
mod=10**9+7
def nCr(n, r, mod):
r = min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n+1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod
if (X+Y)%3 != 0:
print((0))
exit()
... | p02862 |
class Solution:
def solve(self, x: int, y: int) -> int:
if (2*x - y) % 3 != 0 or (-x + 2*y) % 3 != 0:
return 0
m = (2*x - y) // 3
n = (-x + 2*y) // 3
if m < 0 or n < 0:
return 0
# calculate {m+n}C{n}
def egcd(a, b):
... | class MathUtil:
# calculate {m+n}C{n}
def egcd(self, a: int, b: int):
if a == 0:
return b, 0, 1
else:
g, y, x = self.egcd(b % a, a)
return g, x - (b // a) * y, y
def modinv(self, a: int, m: int):
g, x, y = self.egcd(a, m)
if g !... | p02862 |
# nCrの左項には nn しか来ない場合、1!～(n-1)!は保持しなくてよいバージョン
def prepare(n, MOD):
# n! の計算
f = 1
for m in range(1, n+1):
f *= m
f %= MOD
fn = f
# n!^-1 の計算
inv = pow(f, MOD-2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1]*(n+1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
... | # nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod
X, Y = list(map(int, input().split()))
if (... | p02862 |
# 法Pの下での組み合わせ数 nCk を求める
# MAX: nの最大値
P = (10**9)+7
fac=[]
inv=[]
finv=[]
# 拡張ユークリッドアルゴリズム
# (d, x, y): d=ax+by を満たすd, x, yを求める
# aとbが互いに素な整数であればgcd(a,b)=d=1, ax=1 (mod b)
# xは法bの元でaの乗法逆元a^-1になる
def exEuclid(a, b):
if (b==0):
return (a, 1, 0)
else:
(dd, xx, yy) = exEuclid(b, a... | # 拡張ユークリッドアルゴリズム
# (d, x, y): d=ax+by を満たすd, x, yを求める
# aとbが互いに素な整数であればgcd(a,b)=d=1, ax=1 (mod b)
# xは法bの元でaの乗法逆元a^-1になる
def exEuclid(a, b):
if (b==0):
return (a, 1, 0)
else:
(dd, xx, yy) = exEuclid(b, a % b)
return (dd, yy, xx - (a//b)*yy)
def mycomb(n, k, p):
k = min(n... | p02862 |
MOD = 10 ** 9 + 7
#互いに素なa,bについて、a*x+b*y=1の一つの解
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
#[x,y]
return [w[0],w[1]]
# aの逆元(mod m)を求める。(aとmは互いに素であることが前提... | def cmb(n, k, mod, fac, ifac):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] * ifac[n-k] % mod
def make_tables(mod, n):
# 階乗テーブル、逆元の階乗テーブルを作成する
fac = [1, 1] # 階乗テーブル
ifac = [1, 1] # 逆元の階乗テーブル
inverse = [0, 1] # 逆元テーブル 0の階乗は1
for i in range(2, n+1):
fac.append((... | p02862 |
def cmb(n, k, mod, fac, ifac):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] * ifac[n-k] % mod
def make_tables(mod, n):
# 階乗テーブル、逆元の階乗テーブルを作成する
fac = [1, 1] # 階乗テーブル
ifac = [1, 1] # 逆元の階乗テーブル
inverse = [0, 1] # 逆元テーブル 0の階乗は1
for i in range(2, n+1):
fac.append((... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def cmb(n, k, mod, fac, ifac):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] * ifac[n-k] % mod
def make_tables(mod, n):
# 階乗テーブル、逆元の階乗テーブルを作成する
fac = [1, 1] # 階... | p02862 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from opera... | p02862 |
class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
finv.append(finv[i - 1] * inv[i] % m... | def nCk(n, k, mod=10 ** 9 + 7):
def xgcd(a, b):
if b == 0:
return (a, 1, 0)
g, x, y = xgcd(b, a % b)
return (g, y, x - (a // b) * y)
p, q = 1, 1
for i in range(n - k + 1, n + 1):
p = (p * i) % mod
for i in range(2, k + 1):
q = (q * i) % mod
... | p02862 |
def main():
def nCk(n, k, mod=10 ** 9 + 7):
def xgcd(a, b):
if b == 0:
return (1, 0)
x, y = xgcd(b, a % b)
return (y, x - (a // b) * y)
p, q = 1, 1
for i in range(n - k + 1, n + 1):
p = (p * i) % mod
for i in r... | def nCk(n, k, mod=10 ** 9 + 7):
if n < k:
return 0
k = min(k, n - k)
numer = 1
for x in range(n - k + 1, n + 1):
numer = (numer * x) % mod
denom = 1
for x in range(1, k + 1):
denom = (denom * x) % mod
return numer * pow(denom, mod - 2, mod) % mod
X, Y = l... | p02862 |
def comb_mod(n,r,m):
ans = 1
for i in range(1,r+1):
ans *= (n-i+1) % m
ans *= pow(i,m-2,m) % m
ans = ans % m
return ans
x,y = list(map(int,input().split()))
m = 10**9+7
n = (x+y)//3
c = 0
if x*0.5 <= y <= 2*x and (x+y)%3 == 0:
r = x - n
c = comb_mod(n,r,m)
else:... | def comb_mod(n,r,m):
ans = 1
for i in range(1,r+1):
ans *= (n-i+1) % m
ans *= pow(i,m-2,m) % m
ans = ans % m
return ans
x,y = list(map(int,input().split()))
m = 10**9+7
if x > 2*y or 2*x < y or (x+y)%3 != 0:
ans = 0
else:
n = (x+y)//3
r = x-n
ans = com... | p02862 |
M=10**9+7
x,y=list(map(int,input().split()))
ans=0
if (x+y)%3==0:
a=(2*y-x)//3
b=(2*x-y)//3
if a>=0 and b>=0:
f1,f2=1,1
for i in range(a+1,a+b+1):
f1*=i
f1%=M
for i in range(1,b+1):
f2*=i
f2%=M
ans=f1*pow(f2,M-2,M)
print((ans%M)) | X,Y=list(map(int,input().split()))
if 2*Y<X or 2*X<Y:
print((0))
exit()
if not((X%3==0 and Y%3==0) or (X%3==1 and Y%3==2) or (X%3==2 and Y%3==1)):
print((0))
exit()
P=10**9+7
A=(2*Y-X)//3
B=(2*X-Y)//3
num = 1
for i in range(A+1, A+B+1):
num=num*i%P
den = 1
for j in range(1, B+1):
den = den*j%... | p02862 |
mod = 10**9 + 7
def nCk(n,k,p):
global mod
k = min(k, n-k)
X = 1
for i in range(k):
X = X * (n - i) % p
X = X * pow(i + 1, p - 2, p) % p
return X
X,Y = list(map(int, input().split()))
ans = 0
if X <= 2*Y and Y <= 2*X and (X + Y) % 3 == 0:
a = (2*Y-X) // 3
... | X,Y = list(map(int, input().split()))
mod = 10**9 + 7
def nCk(n,k,p):
fact = [1,1] + [0]*(n-1)
inv = [0,1] + [0]*(n-1)
factinv = [1,1] + [0]*(n-1)
for i in range(2, n+1):
fact[i] = i * fact[i-1] % p
inv[i] = - inv[p % i] * (p // i) % p
factinv[i] = factinv... | p02862 |
def comb(n, r, p):
x, y = 1, 1
for i in range(n, n - r, -1):
x *= i
y *= i + r - n
x %= p
y %= p
return pow(y, p - 2, p) * x % p
x, y = list(map(int, input().split()))
n = (x + y) // 3
p = 10 ** 9 + 7
if (x + y) % 3 == 0:
r = 0
if x > y:
x, y =... | def comb(n, r, p):
x, y = 1, 1
for i in range(n, n - r, -1):
x *= i
y *= i + r - n
x %= p
y %= p
return pow(y, p - 2, p) * x % p
x, y = list(map(int, input().split()))
n = (x + y) // 3
p = 10 ** 9 + 7
if (x + y) % 3 == 0 and max(x, y) <= 2 * min(x, y):
r = 0... | p02862 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9+7
def comb(n, k):
c = 1
for i in range(k):
c *= n - i
c %= mod
d = 1
for i in range(1, k + 1):
d *= i
d %= mod
return (c * pow(d, mod - 2, mod)) % mod
x,y = list(map(int... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9+7
def comb(n, k):
c = 1
for i in range(k):
c *= n - i
c %= mod
d = 1
for i in range(1, k + 1):
d *= i
d %= mod
return (c * pow(d, mod - 2, mod)) % mod
x,y = list(map(int... | p02862 |
def comb(n, k, mod):
if k > (n // 2):
k = n - k
a = 1
for i in range(k):
a *= (n - i)
a %= mod
for i in range(k - 1):
a = (a * pow(k - i, mod - 2, mod)) % mod
return a
X, Y = list(map(int, input().split()))
ans = 0
mod = 10 ** 9 + 7
if X > Y:
X, ... | def comb(n, k, mod):
if k > (n // 2):
k = n - k
a = 1
for i in range(k):
a = (a * (n - i)) % mod
b = 1
for i in range(k - 1):
b = (b *(k - i)) % mod
a = (a * pow(b, mod - 2, mod)) % mod
return a
X, Y = list(map(int, input().split()))
ans = 0
mod = 10 ... | p02862 |
X,Y=list(map(int,input().split()))
mod=10**9+7
if (X+Y)%3!=0:
print((0));exit()
if X*2<Y or Y*2<X:
print((0));exit()
t=(X+Y)//3
f=[1]
for i in range(1,t+100):
f.append(f[-1]*i%mod)
def comb(a,b,m):
return f[a]*pow(f[b],m-2,m)*pow(f[a-b],m-2,m)%m
print((comb(t,X-t,mod)))
| M=10**9+7
x,y=list(map(int,input().split()))
ans=0
if (x+y)%3==0:
a=(2*y-x)//3
b=(2*x-y)//3
if a>=0 and b>=0:
f1,f2=1,1
for i in range(a+1,a+b+1):
f1*=i
f1%=M
for i in range(1,b+1):
f2*=i
f2%=M
ans=f1*pow(f2,M-2,M)
print((ans%M))
| p02862 |
fac = [0] * 700000
finv = [0] * 700000
inv = [0] * 700000
mod = 1000000007
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, 700000):
fac[i] = fac[i - 1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
x, y = list(map(int, inp... | mod = 10 ** 9 + 7
ans = 0
x, y = list(map(int, input().split()))
if (x + y) % 3 == 0:
k = (2 * x - y) // 3
l = (2 * y - x) // 3
if k >= 0 and l >= 0:
fac = [1] * (k + l + 1)
for i in range(2, k + l + 1):
fac[i] = fac[i - 1] * i % mod
ans = fac[k + l] * (pow(... | p02862 |
x,y = list(map(int,input().split()))
ans = 0
mod = 10**9+7
if (x+y)%3 == 0:
m = (2*y-x)//3
n = (2*x-y)//3
if m >= 0 and n >= 0:
fac = [1]*(m+n+1)
for i in range(2,m+n+1):
fac[i] = fac[i-1]*i % mod
ans = fac[m+n]*(pow(fac[m],mod-2,mod)*pow(fac[n],mod-2,mod)%mo... | def comb(n,k,mod):
x = y = 1
for i in range(min(k,n-k)):
x = x*(n-i)%mod
y = y*(i+1)%mod
return x * pow(y, mod-2, mod) % mod
x,y = list(map(int,input().split()))
ans = 0
mod = 10**9+7
if (x+y)%3 == 0:
a = (-x+2*y)//3
b = (2*x-y)//3
if a >= 0 and b >= 0: ans = comb(a... | p02862 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | p02862 |
x,y = list(map(int,input().split()))
class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
... | X,Y = list(map(int,input().split()))
n = (-X+2*Y)//3
m = (2*X-Y)//3
mod = 10**9+7 #出力の制限
N = max(n+m,n)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
fo... | p02862 |
X,Y = list(map(int,input().split()))
n = (-X+2*Y)//3
m = (2*X-Y)//3
mod = 10**9+7 #出力の制限
N = max(n+m,n)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
fo... | X,Y = list(map(int,input().split()))
n = (-X+2*Y)//3
m = (2*X-Y)//3
MOD = 10**9+7
def comb(n,r,MOD):
x = n+1
y = min(r,n-r)
numer = 1
denom = 1
for i in range(1,r+1):
numer = numer*(x-i)%MOD
denom = denom*(i)%MOD
return numer * pow(denom,MOD-... | p02862 |
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7
nums = 10**6 # 制約に合わせよう
g1, g2, inverse = [1, 1] , [1, 1], [0, 1]
for num in range(2, nums + 1):
g1.append((g1[-1] * num) % mod)
inverse.append((-inverse[mod... | def nCr(n, r, mod):
x, y = 1, 1
for r_ in range(1, r+1):
x = x*(n+1-r_)%mod
y = y*r_%mod
return x*pow(y, mod-2, mod)%mod
x, y = list(map(int, input().split()))
mod = 10**9+7
if (x+y)%3 or 2*x<y or 2*y<x:
print((0))
else:
print((nCr((x+y)//3,(2*x-y)//3, mod))) | p02862 |
MAX = 1000010
finv = [0] * MAX
inv = [0] * MAX
def COMinit():
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
inv[i] = MOD - inv[MOD%i] * (MOD//i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def COM(n, k):
res = 1
for i in range(k):
res = res * (n-i) % MOD... | MOD = 10**9+7
MAX = 1000010
finv = [0] * MAX
inv = [0] * MAX
def COMinit():
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
inv[i] = MOD - inv[MOD%i] * (MOD//i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def COM(n, k):
res = 1
for i in range(k):
res = res ... | p02862 |
MOD = 10**9+7
X, Y = sorted(list(map(int, input().split())))
if (X+Y)%3 != 0:
print((0))
exit()
if (2*X < Y):
print((0))
exit()
W = X - ((X+Y)//3)
H = Y - ((X+Y)//3)
mx = 10**6
fact = [1] * (mx+1) # 階乗を格納するリスト
def inv(n): # MODを法とした逆元
return pow(n, MOD-2, MOD)
for i in range(mx... | MOD = 10**9+7
X, Y = list(map(int, input().split()))
if (X > Y):
X, Y = Y, X
if (X+Y)%3 != 0:
print((0))
exit()
if (2*X < Y):
print((0))
exit()
W = X - ((X+Y)//3)
H = Y - ((X+Y)//3)
mx = 10**6
fact = [1] * (mx+1) # 階乗を格納するリスト
def inv(n): # MODを法とした逆元
return pow(n, MOD-2, M... | p02862 |
def num_combinations_mod(n, r, mod, num_max=10**6):
# if this functions is called twice or more, init process should be placed before calling this function to
# save time.
if r > n:
return 0
elif r == n:
return 1
elif r < 0 or n < 0:
return 0
f_mod, f_mod_inv = n... | def num_combinations_mod2(n, r, mod=10 ** 9 + 7):
# mod must be a prime.
# nCr = (n! / (n-r)!) * (r!)^-1
# a = n! / (n-r)!
# b = (r!)^-1
if r > n:
return 0
if r < 0 or n < 0:
return 0
r = min(r, n - r)
a = 1
b = 1
for i in range(1, r + 1):
a =... | p02862 |
def nCr(n,r):
dividend,divisor = 1,1
for i in range(r):
dividend *= n-i
divisor *= 1+i
dividend %= MOD
divisor %= MOD
return (dividend * pow(divisor, MOD-2, MOD)) % MOD
X,Y = list(map(int,input().split()))
INF = 10**15
MOD = 10**9+7
if (X+Y)%3!=0:
print((0))
exit()
n = (-... | def nCr(n,r):
dividend = 1
divisor = 1
MOD = 10**9+7
d1 = n
for i in range(1,r+1):
dividend *= d1
divisor *= i
d1 -= 1
dividend %= MOD
divisor %= MOD
return (dividend * pow(divisor, MOD-2, MOD)) % MOD
X,Y = list(map(int,input().split()))
if (X+Y) % 3 != 0:
print((0)... | p02862 |
MOD = 10 ** 9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs... | MOD = 10 ** 9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs... | p02862 |
#べき乗関数powを使った逆元の計算
def modinv2(a,m):
return pow(a,m-2,m)
X,Y = list(map(int,input().split()))
X,Y = min(X,Y),max(X,Y)
if (X+Y)%3 != 0 or X*2-Y < 0:
ans = 0
else:
a = (2*X-Y)//3
b = (2*Y-X)//3
m = 10**9+7
ans = 1
for i in range(1,a+b+1):
ans = ans*i%m
for i in ... | #べき乗関数powを使った逆元の計算
def modinv2(a,m):
return pow(a,m-2,m)
X,Y = list(map(int,input().split()))
X,Y = min(X,Y),max(X,Y)
if (X+Y)%3 != 0 or X*2-Y < 0:
ans = 0
else:
a = (2*X-Y)//3
b = (2*Y-X)//3
m = 10**9+7
ans = 1
for i in range(b+1,a+b+1):
ans = ans*i%m
for i i... | p02862 |
#拡張ユークリッド互除法
#ax+by=1の1つの解(gcd(a,b)=1)
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2] != 1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
#[x,y]
return [w[0],w[1]]
# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def m... | #拡張ユークリッド互除法
#ax+by=1の1つの解(gcd(a,b)=1)
#仕組みをちゃんと理解していない
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2] != 1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
#[x,y]
return [w[0],w[1]]
# aの逆元(mod m)を求める。(aとmは互い... | p02862 |
def modinv(a,m):
return pow(a,m-2,m)
x,y = list(map(int,input().split()))
if (x+y)%3 != 0 or 2*y-x < 0 or 2*x-y < 0:
print((0))
else:
a = (2*y-x)//3
b = (2*x-y)//3
ans = 1
mod = 10**9+7
for i in range(1,a+1):
ans = ans*(i+b)*modinv(i,mod)%mod
print(ans)
| #nCrをmodで割った余りO(r)
def comb(n, r, mod):
r = min(r, n-r)
mol = 1
deno = 1
for i in range(1, r+1):
mol = mol * (n-r+i) % mod
deno = deno * i % mod
ret = mol * pow(deno, mod-2, mod) % mod
return ret
x,y = list(map(int,input().split()))
if (x+y)%3 != 0 or 2*y-x < 0 or 2*... | p02862 |
def p_d():
x, y = list(map(int, input().split()))
if y > x:
x, y = y, x
if (x + y) % 3 != 0:
print((0))
exit()
if x - y > (x + y) // 3:
print((0))
exit()
x, y = x - (x + y) // 3, y - (x + y) // 3
mod = 10 ** 9 + 7 # 出力の制限
N = x + y
... | def p_d():
x, y = list(map(int, input().split()))
if y > x:
x, y = y, x
if (x + y) % 3 != 0:
print((0))
exit()
if x - y > (x + y) // 3:
print((0))
exit()
x, y = x - (x + y) // 3, y - (x + y) // 3
def c_mod(n, r, mod=10 ** 9 + 7):
n1, ... | p02862 |
X,Y = list(map(int,input().split()))
if X>Y:
X,Y = Y,X
if(X+Y)%3:
print((0))
exit()
n = (X+Y)//3
if X < n:
print((0))
exit()
MOD = 10**9+7
r = X-n
maxn = n+5
fac = [1,1] + [0]*maxn
finv = [1,1] + [0]*maxn
inv = [0,1] + [0]*maxn
for i in range(2,maxn+2):
fac[i] = fac[i-1] * i... | X,Y = list(map(int,input().split()))
MOD = 10**9+7
if (X+Y)%3:
print((0))
exit()
n = (X+Y)//3
r = X-n
if not 0 <= r <= n:
print((0))
exit()
MAXN = r
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
def comb(n,r):
ret = 1
for i in ra... | p02862 |
def sq(a, b, mod): # aのb乗を剰余,kは初期値#20191116-D-Knight
if b == 0:
return 1
elif b % 2 == 0:
return sq(a, b // 2, mod)**2 % mod
else:
return sq(a, b - 1, mod) * a % mod
def nCk(n, k, mod=10**9 + 7):
x = max(k, n - k)
y = min(k, n - k)
kkai = 1
for i in ra... | def sq(a, b, mod): # aのb乗を剰余,kは初期値#20191116-D-Knight
if b == 0:
return 1
elif b % 2 == 0:
return sq(a, b // 2, mod)**2 % mod
else:
return sq(a, b - 1, mod) * a % mod
def nCk(n, k, mod=10 ** 9 + 7):
x = max(k, n - k)
y = min(k, n - k)
kkai = 1
for i in ... | p02862 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.