input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#D
def main():
mod=1000000007
x,y=list(map(int,input().split()))
k=min(x,y//2)
l=min(x//2,y)
n=k+l
Fact=[1]
for i in range(1,n+1):
Fact.append(Fact[i-1]*i%mod)
Finv=[0]*(n+1) #階乗の逆元
Finv[-1]=pow(Fact[-1],mod-2,mod)
for i in range(n-1,-1,-1):
Fin... | def main():
mod=1000000007
x,y=list(map(int,input().split()))
if (x+y)%3:
return 0
n=(x+y)//3
Fact=[1]
for i in range(1,n+1):
Fact.append(Fact[i-1]*i%mod)
Finv=[0]*(n+1)
Finv[-1]=pow(Fact[-1],mod-2,mod)
for i in range(n-1,-1,-1):
Finv[i]=Finv... | p02862 |
import sys
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 ... | import math
import sys
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 rang... | p02862 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from math import factorial
from math import floor
P = int(1e9)+7
def c(n, m, P):
ch = 1
for i in range(m):
ch *= (n-i)
ch %= P
b = factorial(m)
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from math import factorial
def main():
x, y = list(map(int, readline().split()))
if ((2*y-x)%3) or ((2*x-y)%3):
print((0))
return
a = (2*y-x)//3
b = (2*x-y)//... | p02862 |
mod=10**9+7
##mod,nについての制約は自分でいかに記入する
def pow_cal(x,n,mod):
if n==0:
return 1
elif n==1:
return x%mod
elif n>=2:
if n%2==0:
return (pow_cal(x,n//2,mod)**2)%mod
else:
return (x*pow_cal(x,n//2,mod)**2)%mod
def find_power(n,mod):
# 0!から... | def find_power(n):
# 0!からn!までのびっくりを出してくれる関数
powlist=[0]*(n+1)
powlist[0]=1
powlist[1]=1
for i in range(2,n+1):
powlist[i]=powlist[i-1]*i%(10**9+7)
return powlist
def find_inv_power(n):
#0!からn!までの逆元を10**9+7で割ったあまりリストを作る関数
powlist=find_power(n)
check=powlist[-1]
... | p02862 |
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 '''
... | MOD = 10**9 + 7
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def modinv(a, mod):
g, x, y = xgcd(a, mod)
assert g == 1, 'modular inverse does not exist'
... | p02862 |
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 fact(self, n):
''' n! % mod '''
if n >= self.mod:
return 0
if self._... | mod = 10**9 + 7
_factorial = [1]
def fact(n):
''' n! % mod '''
if n >= mod:
return 0
_size = len(_factorial)
if _size < n+1:
for i in range(_size, n+1):
_factorial.append(_factorial[i-1]*i % mod)
return _factorial[n]
_factorial_inv = [1]
def fact_inv(n):... | p02862 |
mod = 10**9 + 7
_factorial = [1]
def fact(n):
''' n! % mod '''
if n >= mod:
return 0
_size = len(_factorial)
if _size < n+1:
for i in range(_size, n+1):
_factorial.append(_factorial[i-1]*i % mod)
return _factorial[n]
_factorial_inv = [1]
def fact_inv(n):... | mod = 10**9 + 7
_factorial = [1]
def fact(n):
''' n! % mod '''
if n >= mod:
return 0
_size = len(_factorial)
if _size < n+1:
for i in range(_size, n+1):
_factorial.append(_factorial[i-1]*i % mod)
return _factorial[n]
_factorial_inv = [1]
def fact_inv(n):... | p02862 |
MOD = 10**9+7
X, Y = list(map(int, input().split()))
x, y = X, Y
while 0 <= y:
if x == 2*y:
break
x += 1
y -= 1
else:
print((0))
exit()
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n-r < r:
r = n-r
for i in range(1, r+1):
... | MOD = 10**9+7
x, y = list(map(int, input().split()))
n, r1 = divmod(2*y-x, 3)
m, r2 = divmod(2*x-y, 3)
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
Y = pow(Y, MOD-2,... | p02862 |
X, Y = list(map(int, input().split()))
if (X+Y)%3 != 0:
print((0))
exit()
N = (X+Y)//3
# C_N_X-N
MAX = 3000000
MOD = 1000000007
fac = [0]*MAX
finv = [0]*MAX
inv = [0]*MAX
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - i... | X, Y = list(map(int, input().split()))
if (X+Y)%3 != 0:
print((0))
exit()
N = (X+Y)//3
# C_N_X-N
MAX = 700000
MOD = 1000000007
fac = [0]*MAX
finv = [0]*MAX
inv = [0]*MAX
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[... | 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 = 2*10**6 + 1
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.append... | p02862 |
X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def createFacArr(n, mod):
fac = [0] * n
finv = [0] * n
inv = [0] * n
fac[0], fac[1] = 1, 1
finv[0], finv[1] = 1, 1
inv[1] = 1
for i in range(2, n):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (m... | X, Y = list(map(int,input().split()))
MOD = 10 ** 9 + 7
def calc_comb(n, k, mod):
'''
n が大きい場合に使う
'''
a = 1
b = 1
for i in range(1,k+1):
a *= i
a %= mod
b *= n
n -= 1
b %= mod
return b * pow(a, mod-2, mod) % mod
if (X+Y) % 3 !=... | p02862 |
import sys
def extgcd(a, b):
r = [1, 0, a]
w = [0, 1, b]
while w[2] != 1:
q = r[2] // w[2]
r2 = w
w2 = [r[0] - q * w[0], r[1] - q * w[1], r[2] - q * w[2]]
r = r2
w = w2
return [w[0], w[1]]
def mod_inv(a, m):
x = extgcd(a, m)[0]
return ... | import sys
def extgcd(a, b):
r = [1, 0, a]
w = [0, 1, b]
while w[2] != 1:
q = r[2] // w[2]
r2 = w
w2 = [r[0] - q * w[0], r[1] - q * w[1], r[2] - q * w[2]]
r = r2
w = w2
return [w[0], w[1]]
def mod_inv(a, m):
x = extgcd(a, m)[0]
return ... | p02862 |
mod = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10 ** 6):
new_fact = fact[-1] * (i + 1) % mod
fact.append(new_fact)
fact_inv.append(pow(new_fact, mod - 2, mod))
def mod_comb_k(n, k, mod):
return fact[n] * fact_inv[k] % mod * fact_inv[n-k] % mod
def solve():
X, Y = list(map... | def mod_comb(n, k, p):
if k > n - k:
k = n - k
numerator = 1
denominator = 1
for i, j in zip(list(range(n - k + 1, n + 1)), list(range(1, k + 1))):
numerator = (numerator * i) % p
denominator = (denominator * j) % p
return (numerator * pow(denominator, p -... | p02862 |
X, Y = [int(_) for _ in input().split()]
mod = 10**9 + 7
#a(1, 2) + b(2, 1) = (X, Y)
#a=(2*Y-X)//3
#b=(2*X-Y)//3
if (2 * Y - X) % 3 == (2 * X - Y) % 3 == 0:
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
f = [1] * (a + b + 1)
for i in r... | X, Y = [int(_) for _ in input().split()]
mod = 10**9 + 7
#a(1, 2) + b(2, 1) = (X, Y)
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if (2 * Y - X) % 3 == (2 * X - Y) % 3 == 0 and a * b >= 0:
f = [1] * (a + b + 1)
for i in range(1, a + b + 1):
f[i] = i * f[i - 1] % mod
fi = [1] * (a + b + 1)
... | p02862 |
X, Y = [int(_) for _ in input().split()]
mod = 10**9 + 7
#a(1, 2) + b(2, 1) = (X, Y)
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if (2 * Y - X) % 3 == (2 * X - Y) % 3 == 0 and a * b >= 0:
f = [1] * (a + b + 1)
for i in range(1, a + b + 1):
f[i] = i * f[i - 1] % mod
fi = [1] * (a + b + 1)
... | X, Y = [int(_) for _ in input().split()]
mod = 10**9 + 7
#a(1, 2) + b(2, 1) = (X, Y)
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if (2 * Y - X) % 3 == (2 * X - Y) % 3 == 0 and a * b >= 0:
f = [1] * (a + b + 1)
for i in range(1, a + b + 1):
f[i] = i * f[i - 1] % mod
fi = [1] * (a + b + 1)
... | p02862 |
mod = 10**9 + 7
class Combination:
def __init__(self, n):
self.facts = [1 for i in range(n+1)]
self.invs = [1 for i in range(n+1)]
for i in range(1, n+1):
self.facts[i] = self.facts[i-1] * i % mod
self.invs[i] = pow(self.facts[i], mod-2, mod)
... | mod = 10**9 + 7
def ncr(n, r):
r = min(r, n-r)
x, y = 1, 1
for i in range(r):
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()))
if 2*Y - X < 0 or 2*X - Y < 0 or (2*Y - X) % 3 != 0 or (2*X - Y) %... | 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 )
inverse.append( ( -inverse[mo... | import math
def cmb(n, r, mod):
r = min(r, n-r)
a = 1
b = 1
for i in range(r):
a = (a * (n-i)) % mod
b = (b * (i+1)) % mod
return a * pow(b, mod-2, mod) % mod
X, Y = [int(i) for i in input().split()]
mod = 10**9+7
x_tmp = 2*X - Y
y_tmp = 2*Y - X
if x_tmp <... | p02862 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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)]
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a % b)
return [y, x - a//b * y, g]
def mod_inverse(a, m):
x, _, _ = extgcd(a, m)
return (m + ... | p02862 |
import math
M = 10**9+7
X,Y = list(map(int,input().split()))
if (X+Y)/3 != (X+Y)//3:
print((0))
exit()
n = (X+Y)//3
r = Y-n
if r<0 or r>n:
print((0))
exit()
#互いに素な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... | import math
M = 10**9+7
X,Y = list(map(int,input().split()))
if (X+Y)/3 != (X+Y)//3:
print((0))
exit()
n = (X+Y)//3
r = Y-n
if r<0 or r>n:
print((0))
exit()
#nCr and Mod
def nCr(n, r, mod=10**9+7):
r = min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = ... | p02862 |
def com(n,r,mod):
k=min(r,n-r)
C=1
for i in range(1,k+1):
C=(C*(n+1-i)*pow(i,mod-2,mod))%mod
return C
x, y = list(map(int,input().split()))
mod = 10 ** 9 + 7
n = (2 * y - x) // 3 if (2 * y - x) % 3 == 0 else -1
m = (2 * x - y) // 3 if (2 * x - y) % 3 == 0 else -1
if n >= 0 and m >=... | def com(n,r,mod):
k=min(r,n-r)
C=1
for i in range(1,k+1):
C=(C*(n+1-i)*pow(i,mod-2,mod))%mod
return C
x, y = list(map(int,input().split()))
mod = 10 ** 9 + 7
m = 2 * x - y
n = 2 * y - x
if m >= 0 and n >= 0 and m % 3 == 0 and n % 3 == 0:
print((com((n + m) // 3, n // 3, mod)))... | p02862 |
X, Y = list(map(int, input().split()))
mod = 10**9+7
if (X+Y) % 3 != 0:
print((0))
else:
n = (2*Y-X)//3
m = (2*X-Y)//3
'''
n*(1,2) + m*(2,1) = (x, y)
x = n+2m
y = 2n+m
2x = 2n+4m
2x-y = 3m
m = (2x-y)/3
n = (2y-x)/3
'''
if 0 > n or 0 > m:
pr... | X, Y = list(map(int, input().split()))
m, r = divmod(2*Y-X, 3)
if r != 0:
print((0))
exit()
n = Y - 2*m
if n < 0 or m < 0:
print((0))
exit()
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in ... | p02862 |
def ncr(n, r):
return fac[n] * facinv[r] * facinv[n - r] % MOD
MOD = 10 ** 9 + 7
X, Y = list(map(int, input().split()))
N = 10 ** 6
fac = [1, 1]
facinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fac.append(fac[i - 1] * i % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
facinv.... | MOD = 10 ** 9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 or Y > 2 * X or Y < X // 2:
print((0))
exit()
n = (X + Y) // 3
r = X - (X + Y) // 3
num, den = 1, 1
if n - r < r:
r = n - r
for i in range(1, r + 1):
num *= n - i + 1
num %= MOD
den *= i
den %= MOD
p... | p02862 |
MOD = 10 ** 9 + 7
X, Y = list(map(int, input().split()))
if (X + Y) % 3 or Y > 2 * X or Y < X // 2:
print((0))
exit()
n = (X + Y) // 3
r = X - (X + Y) // 3
num, den = 1, 1
if n - r < r:
r = n - r
for i in range(1, r + 1):
num *= n - i + 1
num %= MOD
den *= i
den %= MOD
p... | def ncr(n, r):
num, den = 1, 1
if n - r < r:
r = n - r
for i in range(1, r + 1):
num *= n - i + 1
num %= MOD
den *= i
den %= MOD
return num * pow(den, MOD - 2, MOD) % MOD
MOD = 10 ** 9 + 7
X, Y = list(map(int, input().split()))
Z = X + Y
if Z % ... | p02862 |
X, Y =list(map(int, input().split()))
mod = 1000000007
import sys
if (X + Y) % 3 != 0:
print((0))
sys.exit()
offset = (X+Y)//3
X, Y = X-offset, Y-offset
if X<0 or Y<0:
print((0))
sys.exit()
X, Y = max(X, Y), min(X, Y)
def C(n, r, mod):
num = 1
den = 1
for i in rang... | X, Y = list(map(int, input().split()))
if (X+Y) % 3 != 0:
print((0))
else:
# 経路
def C(n, r, mod):
num = 1
den = 1
for i in range(r):
num *= n-i
num %= mod
den *= i+1
den %= mod
return (num * pow(den, mod-2, mo... | 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 + 10
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inver... | x, y = list(map(int, input().split()))
mod = 10 ** 9 + 7
cnt1 = cnt2 = 0
for i in range(x + 1):
x_left = x - i
y_left = y - 2 * i
if x_left == y_left * 2:
cnt1 = i
cnt2 = y_left
if cnt1 == cnt2 == 0:
ans = 0
else:
ans = 1
for i in range(1, cnt1 + 1):
ans... | p02862 |
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):
... | x,y=list(map(int,input().split()))
if (x+y)%3:print((0))
else:
sab=(x+y)//3
a=y-sab
b=sab-a
if a<0 or b<0:print((0));exit()
mod=10**9+7
fact=[1]*(sab+1)
inv=[1]*(sab+1)
for i in range(2,sab+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in ... | 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
x,y=list(map(int,input().split()))
g1=[1,1]
g2=[1,1]
inverse=[0,1]
n,m=(2*y-x)//3,(2*x-y)//3
if (x+y)%3!=0 or n<0 or m<0:print((0));exit()
for i in range(2,n+m+1):
g1.append((g1[-1]*i)%mo... | mod=10**9+7
x,y=list(map(int,input().split()))
X,Y=(2*y-x)//3,(2*x-y)//3
if X<0 or Y<0 or (x+y)%3!=0:print((0));exit()
def cmb(n,r,mod):
if r<0 or r>n:return 0
return g1[r]*g2[r]%mod
n=X+Y
k=max(X,Y)
g1=[1,n]
g2=[1,1]
inverse=[0,1]
for i,j in enumerate(range(n-1,((n-k+1)-1),-1)):
i=... | p02862 |
X,Y=list(map(int,input().split()))
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7
N = 10**6
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ... | 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 |
x,y = list(map(int,input().split()))
mod = 10**9 + 7
if (x+y)%3 != 0:
print((0))
exit()
if (2*y-x)%3 !=0 or (2*x-y)%3 != 0 or 2*y-x <0 or 2*x-y<0:
print((0))
exit()
a = (2*y-x)//3
b = (2*x-y)//3
def inverse(a,p):
return pow(a,p-2,p)
def combination_modp(n, r, p): # nCr modpを求める
... | def combination_modp(n, r, p): # nCr modpを求める
r = min(n-r, r)
result = 1
for i in range(n, n-r, -1):
result *= i
result %=p
for i in range(1, r+1):
result *= pow(i,p-2,p)
result %= p
return result
x,y = list(map(int,input().split()))
mod = 10**9 + 7
if... | p02862 |
x,y=list(map(int,input().split()))
a3=2*x-y
b3=2*y-x
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
if a3%3!=0 or b3%3!=0:
print((0))
else:
a=a3//3
b=b3//3
if a>b:
a,b=b,a
N=a+b
g1 = [1, 1]
g2 = [1,... | X,Y=list(map(int,input().split()))
# (i+1,j+2)の移動をa回
# (i+2,j+1)の移動をb回
# X=a+2b
# Y=2a+b
# となるa,bが存在するか？
# b=(2X-Y)/3が整数となればOK
b=(2*X-Y)/3
if not float.is_integer(b):
print((0))
exit(0)
b=int(b)
a=X-2*b
# aとbの回数が決まったので、a+bCmin(a,b)をやればいい
DIV=10**9+7
from functools import reduce
def nCr(n... | p02862 |
X, Y = list(map(int, input().split()))
mod = 10 ** 9 + 7
# modしながらコンビネーションを求める
def mod_cmb(n, r, mod):
p, q = 1, 1
for i in range(r):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return p * mod_inverse(q, mod) % mod
# modしたa^bを求める
def mod_pow(a, p, mod):
if p == 0:
... | X, Y = list(map(int, input().split()))
mod = 10 ** 9 + 7
# modしながらコンビネーションを求める
def mod_cmb(n, r, mod):
p, q = 1, 1
for i in range(r):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return p * mod_inverse(q, mod) % mod
# modしたa^bを求める
def mod_pow(a, p, mod):
if p == 0:
... | p02862 |
x,y = list(map(int,input().split()))
if x > y*2 or y > x*2 or (x+y)%3 != 0:
print((0))
exit()
n = (x+y)//3
r = min(x-n,2*n-x)
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]
in... | x,y = list(map(int,input().split()))
if (x+y)%3 != 0:
print((0))
quit()
elif x < (x+y)//3 or y < (x+y)//3:
print((0))
quit()
else:
n = (x+y)//3
r = x-n
mod = 10**9+7
def cmb(n,r,mod):
r = min(r, n-r)
return (fact[n] * factinv[r] * factinv[n-r]) % mod
def makefact(n,mod):
... | p02862 |
import math
mod = 10**9 + 7
x, y = list(map(int, input().split()))
if (x+y)%3 != 0:
print((0))
exit()
if x == 0 or y == 0:
print((0))
exit()
X = max(x,y)
Y = min(x,y)
all_move = (X+Y)//3
diff = (X-Y)
y_move = (all_move - diff)//2
def cmb(n, r, mod):
if ( r<0 or r>n ):
... | import math
MOD = 10**9 + 7 # 素数
x, y = list(map(int, input().split()))
if (x+y)%3 != 0:
print((0))
exit()
if x == 0 or y == 0:
print((0))
exit()
X = max(x,y)
Y = min(x,y)
all_move = (X+Y)//3
diff = (X-Y)
Y_move = (all_move - diff)//2
def mod_cmb(n, r, mod): # nCr mod p
g1... | p02862 |
def d_knight():
X, Y = [int(i) for i in input().split()]
if (abs(X) + abs(Y)) % 3 != 0 or Y > 2 * X or 2 * Y < X:
return 0
n = (abs(X) + abs(Y)) // 3
k = -1
for x in range(n, 2 * n + 1):
if Y == 3 * n - x:
k = x - n
break
class Combination(... | def d_knight():
X, Y = [int(i) for i in input().split()]
def combination(n, r, mod):
r = min(r, n - r)
numerator, denominator = 1, 1
for i in range(1, r + 1):
numerator = (numerator * (n + 1 - i)) % mod
denominator = (denominator * i) % mod
retur... | p02862 |
x,y=list(map(int,input().split()))
MAX_NUM = 2*10**6 + 1
pr = 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] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % pr
inv[i] = pr - inv[... | x,y=list(map(int,input().split()))
MAX_NUM = 2*10**6 + 1
MAX_NUM//=3
MAX_NUM+=1
pr = 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] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % p... | p02862 |
from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
X, Y = list(map(int, input().split()))
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print((0))
exit()
MOD ... | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
X, Y = list(map(int, input().split()))
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print((0))
... | p02862 |
from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
X, Y = list(map(int, input().split()))
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print((0))
... | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
X, Y = list(map(int, input().split()))
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print((0))
exit()
de... | p02862 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def mod_com_once(n, r, MOD):
if n < r:
return 0
if n < 0 or r < 0:
return 0
r = min(r, n - r)
numer = denom = 1
for i in rang... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def mod_com_once(n, r, MOD):
if n < r:
return 0
if n < 0 or r < 0:
return 0
r = min(r, n - r)
numer = denom = 1
for i in rang... | p02862 |
mod = 10**9+7
n = 10**6
def comb(n, r):
if 2 * r > n: return comb(n, n-r)
return fac[n] * inv[r] * inv[n-r] % mod
x, y = list(map(int, input().split()))
if (x+y) % 3 != 0:
print((0))
exit()
a = -(x-2*y)//3
b = (2*x-y)//3
if a<0 or b<0:
print((0))
exit()
fac = [1] * (n+2)
i... | mod = 10**9+7
def comb(n, r):
if 2 * r > n: return comb(n, n-r)
return fac[n] * inv[r] * inv[n-r] % mod
x, y = list(map(int, input().split()))
if (x+y) % 3 != 0:
print((0))
exit()
n = (x+y)//3
x -= n
y -= n
if x<0 or y<0:
print((0))
exit()
fac = [1] * (n+2)
inv = [1] * (n+2... | p02862 |
x,y=list(map(int,input().split()))
mod=10**9+7
n_max=10**6+1
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[i+1]=pow(F[i+1],mod-2,mod)
def comb(x,y):
return (F[x]*FI[x-y]*FI[y])%mod
a,b=2*y-x,2*x-y
if a<0 or b<0:
print((0))
elif a%3!=0 or b%3!=0:
... | x,y=list(map(int,input().split()))
mod=10**9+7
n_max=10**6+1
F=[0]*(n_max+1)
F[0]=1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
def comb(x,y):
return (F[x]*pow(F[x-y],mod-2,mod)*pow(F[y],mod-2,mod))%mod
a,b=2*y-x,2*x-y
if a<0 or b<0:
print((0))
elif a%3!=0 or b%3!=0:
print((0))
else:
a//=3
... | p02862 |
class Combination:
'''mod上の
計算量：階乗・逆元テーブルの作成O(N)
nCkを求めるO(1)'''
def __init__(self, n, mod):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % mod)
self.inv_fact = [pow(self.fact[i], mod - 2, mod) for i in range(n + 1)]
... | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, mod):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % mod)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], mod - 2, mod)
... | p02862 |
def mod_inv(a, m):
return pow(a,m-2,m)
X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
if (X + Y) % 3:
print((0))
exit()
n = (X + Y) // 3
nx, ny = X - n, Y - n
if nx < 0 or ny < 0:
print((0))
exit()
ans = 1
for i in range(1, nx + ny + 1):
ans = ans * i % MOD
f... | def mod_inv(a, m):
return pow(a, m-2, m)
X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
if (X + Y) % 3:
print((0))
exit()
n = (X + Y) // 3
nx, ny = X - n, Y - n
if nx < 0 or ny < 0:
print((0))
exit()
ans = 1
for i in range(nx + 1, nx + ny + 1):
ans = ans * i %... | p02862 |
MOD = 10**9 + 7
def nck(n, k):
numer, denom = 1, 1
for i in range(k):
numer = numer * (n - i) % MOD
denom = denom * (k - i) % MOD
return numer * pow(denom, MOD-2, MOD) % MOD
x, y = list(map(int, input().split()))
# (1, 2) 動く回数をm回、(2, 1) 動く回数をn回とする
n = -1
for m in range(min(x//1, ... | def nck(n, k):
numer, denom = 1, 1
for i in range(k):
numer = numer * (n-i) % MOD
denom = denom * (k-i) % MOD
return numer * pow(denom, MOD-2, MOD) % MOD
x, y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
i = 2 * y - x
j = 2 * x - y
if i % 3 != 0 or j % 3 != 0 or i < 0 or... | p02862 |
import math
import itertools
x,y=list(map(int, input().split()))
v=x+y
if v%3!=0:
print((0))
exit()
if (v//3-abs(x-y))%2!=0:
print((0))
exit()
v1=(v//3-abs(x-y))//2+abs(x-y)
v2=v//3-v1
if v2<0:
print((0))
exit()
def cmb(n, r):
if n - r < r: r = n - r
if r == 0... | x,y= list(map(int, input().split()))
a=min(x,y)
b=max(x,y)
mod=pow(10,9)+7
if b-a>a or (a-(b-a))%3!=0:
print((0))
else:
r=(a-(b-a))//3
l=((a-(b-a))//3)+(b-a)
c=1
d=1
for i in range(r):
c=(c*(l+r-i))%mod
d=(d*(r-i))%mod
ans=c*pow(d,mod-2,mod)
print((ans%mo... | p02862 |
x, y = list(map(int, input().split()))
mod = 1000000007
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):
... | x, y = list(map(int, input().split()))
mod = 10**9+7
def inv(x):
return pow(x, mod-2, mod)
def fact(x):
f = 1
for i in range(1, x + 1):
f *= i
f %= mod
return f
def comb(n, r):
return (fact(n) * inv(fact(n-r)) * inv(fact(r))) % mo... | p02862 |
x, y = list(map(int, input().split()))
diff = abs(x - y)
ref = (min(x, y) - diff)//3
total = ref*2 + diff
mod = 10**9 + 7
ans = 1
if (x + y)%3 != 0 or ref < 0:
print((0))
exit()
for i in range(min(ref, total - ref)):
ans = ans*(total - i)%mod
ie = pow((i + 1), (mod - 2), mod)
ans =... | x, y = list(map(int, input().split()))
diff = abs(x - y)
ref = (min(x, y) - diff)//3
total = ref*2 + diff
mod = 10**9 + 7
ans = 1
ie = 1
if (x + y)%3 != 0 or ref < 0:
print((0))
exit()
for i in range(min(ref, total - ref)):
ans = ans*(total - i)%mod
ie = ie*(i + 1)%mod
ie = pow(ie, ... | p02862 |
def cmb(n, k, mod, fac, infac):
k = min(k,n-k)
return fac[n] * infac[k] * infac[n-k] % mod
def tables(mod, n):
fac = [1, 1]
infac = [1, 1]
inverse = [0, 1]
for i in range(2, n+1):
fac.append((fac[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
infac.append((... | X,Y = list(map(int,input().split()))
M = max(X,Y)
m = min(X,Y)
mod = 10 ** 9 + 7
con = (X + Y) // 3
dif = M - m
n = (con - dif) // 2
if (X + Y) % 3 != 0 or n < 0:
print((0))
else:
def comb(n, r):
n += 1
over = 1
under = 1
for i in range(1,r + 1):
over = over * (n - i) % ... | p02862 |
def knight(x, y):
mod = 10 ** 9 + 7
x, y = min(x, y), max(x, y)
if (x + y) % 3 != 0:
return 0
if y > 2 * x:
return 0
move = (x + y) // 3
right = 2 * move - y
up = move-right
ans = 1
for i in range(1, move + 1):
ans *= i
ans %= mod
... | def knight(x, y):
mod = 10 ** 9 + 7
x, y = min(x, y), max(x, y)
if (x + y) % 3 != 0:
return 0
if y > 2 * x:
return 0
move = (x + y) // 3
right = 2 * move - y
up = move-right
ans = 1
for i in range(up):
ans *= (move - i)
ans *= pow(i ... | p02862 |
def knight(x, y):
mod = 10 ** 9 + 7
x, y = min(x, y), max(x, y)
if (x + y) % 3 != 0:
return 0
if y > 2 * x:
return 0
move = (x + y) // 3
right = 2 * move - y
up = move-right
ans = 1
for i in range(up):
ans *= (move - i)
ans *= pow(i ... | def knight(x, y):
mod = 10 ** 9 + 7
x, y = min(x, y), max(x, y)
if (x + y) % 3 != 0:
return 0
if y > 2 * x:
return 0
move = (x + y) // 3
right = 2 * move - y
up = move-right
ans = 1
tmp = 1
for i in range(up):
ans *= (move - i)
... | p02862 |
mod = 10**9+7
N = 10**6
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod//i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
return g1[... | mod = 10**9+7
X, Y = list(map(int, input().split()))
def comb(n, r, mod):
if r < 0 or n < r:
return 0
return fact[n]*pow(fact[r], mod-2, mod) * pow(fact[n-r], mod-2, mod) % mod
if (X + Y) % 3 != 0:
ans = 0
else:
n = (X + Y) // 3
r = min(X, Y)-n
# nCr
fact = [1, ... | p02862 |
N, a, b = list(map(int, input().split())); a -= 1; b -= 1
P = []
Q = []
for i in range(N):
x, y = list(map(int, input().split()))
P.append((x-y, x+y, i))
Q.append((x+y, x-y, i))
d = max(abs(P[a][0] - P[b][0]), abs(P[a][1] - P[b][1]))
G = [set() for i in range(N)]
def solve(P0):
P = P0[:]... | N, a, b = list(map(int, input().split())); a -= 1; b -= 1
P = []
Q = []
for i in range(N):
x, y = list(map(int, input().split()))
P.append((x-y, x+y, i))
Q.append((x+y, x-y, i))
d = max(abs(P[a][0] - P[b][0]), abs(P[a][1] - P[b][1]))
*parent, = list(range(N))
def root(x):
if x == parent[x]... | p03858 |
N, a, b = list(map(int, input().split())); a -= 1; b -= 1
P = []
Q = []
for i in range(N):
x, y = list(map(int, input().split()))
P.append((x-y, x+y, i))
Q.append((x+y, x-y, i))
d = max(abs(P[a][0] - P[b][0]), abs(P[a][1] - P[b][1]))
*parent, = list(range(N))
def root(x):
if x == parent[x]... | N, a, b = list(map(int, input().split())); a -= 1; b -= 1
P = []
Q = []
for i in range(N):
x, y = list(map(int, input().split()))
P.append((x-y, x+y, i))
Q.append((x+y, x-y, i))
d = max(abs(P[a][0] - P[b][0]), abs(P[a][1] - P[b][1]))
*parent, = list(range(N))
def root(x):
if x == parent[x]... | p03858 |
n = int(eval(input()))
print((n*n*n))
| n = int(eval(input()))
print((n**3))
| p02915 |
# 2019-11-18 00:38:19(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
import re
# import heapq
# import arr... | import sys
n = int(sys.stdin.readline().rstrip())
def main():
return n ** 3
if __name__ == '__main__':
ans = main()
print(ans) | p02915 |
N = int(eval(input()))
print((N**3)) | num = int(eval(input()))
print((num ** 3)) | p02915 |
N = int(eval(input()))
print((N**3))
| def main() -> None:
print((int(eval(input())) ** 3))
if __name__ == '__main__':
main()
| p02915 |
a = int(eval(input()))
print((a**3))
| a=int(eval(input()))
print((a*a*a))
| p02915 |
"""
author : halo2halo
date : 18,Oct,2019
"""
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline().rstrip())
print((N**3))
| """
author : halo2halo
date : 9, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
A=int(read())
print((A**3))
| p02915 |
def resolve():
n = int(eval(input()))
print((n**3))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
print((int(eval(input()))**3))
resolve() | p02915 |
N = int(eval(input()))
print((pow(N, 3))) | #input
N = int(eval(input()))
#output
print((pow(N, 3))) | p02915 |
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
def main():
num = int(eval(input()))
print((num... | a = int(eval(input()))
answer = a * a * a
print(answer) | p02915 |
n=int(eval(input()))
print((n**3)) | n=int(eval(input()))
print((n*n*n)) | p02915 |
n = int(eval(input()))
print((n*n*n)) | n = int(eval(input()))
print((n**3)) | p02915 |
n = int(eval(input()))
print((n*n*n)) | n = int(eval(input()))
print((n**3)) | p02915 |
n = int(eval(input()))
print(("{}".format(n**3))) | n = int(eval(input()))
print((n**3)) | p02915 |
N=int(eval(input()))
print((N**3)) | print((int(eval(input())) ** 3)) | p02915 |
N = int(eval(input()))
print((N**3)) | N=int(eval(input()))
print((N*N*N)) | p02915 |
n=int(eval(input()))
print((n**3)) | print((int(eval(input()))**3)) | p02915 |
n = eval(input())
n = int(n)
typ = n ** 3
print(typ) | n = int(eval(input()))
print((n ** 3)) | p02915 |
import math
def lazy_update(s, e, value):
a = [(1, l+s, l+e, 1)]
while a:
k, s, e, depth = a.pop()
l_end, r_end = k << (rank-depth), (k+1) << (rank-depth)
mid = (l_end + r_end) // 2
if s == l_end and e == r_end:
lazy[k] = value
else:
if l... | import math
def lazy_update(s, e, value):
a = [(1, l+s, l+e, 1)]
ap = a.append
while a:
k, s, e, depth = a.pop()
l_end, r_end = k << (rank-depth), (k+1) << (rank-depth)
mid = (l_end + r_end) // 2
if s == l_end and e == r_end:
lazy[k] = value
el... | p02348 |
import math
INT_MAX = 2147483647
MAX = 100003
n,q=(int(x) for x in input().split())
b= int(math.sqrt(n))
def update(x_f):
x = int(x_f)
for i in range(int(x*b),min(n-1,int((x+1)*b-1))+1):a[i]=l[x]
l[x]=-1
return
if __name__=='__main__':
a = [INT_MAX for i in ra... | import math
INT_MAX = 2147483647
MAX = 100003
n,q= l = list(map(int, input().split()))
b= int(math.sqrt(n))
def update(x_f):
x = int(x_f)
for i in range(int(x*b),min(n-1,int((x+1)*b-1))+1):a[i]=l[x]
l[x]=-1
return
if __name__=='__main__':
a = [INT_MAX for i in... | p02348 |
import sys
sys.setrecursionlimit(20000)
def update(Set,x,y,z):
for i in range(x,y+1):
Set[i] = z
def lazy_update(Set,x,y,z):
left = int(x/4)
if((x%4)!=0):
left = left + 1
right = int(y/4)
for i in range(left,right):
Set[i] = z
return left*4,right*4
if __n... | import sys
import time
sys.setrecursionlimit(20000)
def update(Set,x,y,z):
for i in range(x,y+1):
Set[i] = z
def lazy_update(Set,x,y,z):
left = int(x/4)
if((x%4)!=0):
left = left + 1
right = int(y/4)
for i in range(left,right):
Set[i] = z
return left*4,righ... | p02348 |
import sys
import math
sys.setrecursionlimit(20000)
INT_MAX = 2**31 - 1
lazy_init = (None,-1)
def lazy_tree_merge(lazy,tree,i,N):
if(lazy[i][0] is not None):
tree[i] = lazy[i]
if(i < N-1):
lazy[i*2+1] = lazy[i]
lazy[i*2+2] = lazy[i]
lazy[i] = lazy_init
d... | import sys
import math
import time
sys.setrecursionlimit(20000)
INT_MAX = 2**31 - 1
def update(tree,x,y,z,N):
left = x + N #- 1
right = y + N#- 1
while True:
if(left >= right):
break
if(right % 2 == 1):
right -= 1
tree[right - 1] = z
... | p02348 |
n=int(input())
s=[input() for _ in range(n)]
cnt=[[0]*26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j])-ord("a")]+=1
ans=""
for j in range(26):
tmp=10**9
for i in range(n):
tmp=min(tmp,cnt[i][j])
ans+=chr(j+ord("a"))*tmp
print(ans) | n = int(input())
s = [input() for _ in range(n)]
cnt = [[0] * 26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j]) - ord("a")] += 1
ans = ""
for j in range(26):
cntmn = 10**9
for i in range(n):
cntmn = min(cntmn, cnt[i][j])
ans += chr(j + ord... | p03763 |
def f(ls,m,s):
global n
count = 0
if m > 0:
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0:
break
else:
count += f(lls,m-1,s-a)
return count
else:
if s == 0:
return 1
else:
return 0
ls = [i for i in range(10)]
while True:
try:
n,s... | def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
if mx(ls,m) < s: return 0
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0: break
else: count += f(lls,m-1,s-a)
return count
... | p00070 |
def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
if mx(ls,m) < s or mn(ls,m) > s: return 0
for i in range(len(ls)):
l... | def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
vmx,vmn = mx(ls,m),mn(ls,m)
if vmx < s or vmn > s: return 0
elif vmx ... | p00070 |
def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
vmx,vmn = mx(ls,m),mn(ls,m)
if vmx < s or vmn > s: return 0
elif vmx ... | def mxmn(ls,m):
global n
s1,s2 = 0, 0
for i in range(m):
s1 += (n-i)*ls[-i-1]
s2 += (n-i)*ls[i]
return s1,s2
def f(ls,m,s):
global n
count = 0
if m > 0:
mx,mn = mxmn(ls,m)
if mx < s or mn > s: return 0
elif mx == s or mn == s: return 1
for i in range(len(ls)):
lls = ls[:]
a = ... | p00070 |
import sys
dp=[[[0]*331 for i in range((1<<10)+1)] for j in range(12)]
#dp[12][1025][340]
dp[0][0][0]=1
for i in range(10):
for j in range(1<<10):
for c in range(331):
if dp[i][j][c]==0:
continue
for k in range(10):
if (j>>k&1)==0:
... | import sys
dp=[[[0]*331 for i in range((1<<10)+1)] for j in range(12)]
#dp[12][1025][331]
dp[0][0][0]=1
for i in range(10):
for j in range(1<<10):
for c in range(331):
if dp[i][j][c]==0:
continue
for k in range(10):
if (j>>k&1)==0:
... | p00070 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from __future__ import (division, absolute_import, print_function,
unicode_literals)
from sys import stdin
def solve(li, n, s, total, cnt):
for i in li:
value = i * n + total
if value > s:
break
if ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from __future__ import (division, absolute_import, print_function,
unicode_literals)
from sys import stdin
def solve(li, n, s, total, cnt):
for i in li:
value = i * n + total
if value > s:
break
if ... | p00070 |
import sys
from itertools import permutations
for line in sys.stdin:
n, s = list(map(int, line.split()))
count = 0
for combi in permutations(list(range(10)), n):
if sum(x * y for (x, y) in zip(list(range(1, 10)), combi)) == s:
count += 1
print(count) | import sys
def memoize(f):
memo = {}
def main(*args):
if args in memo:
return memo[args]
result = memo[args] = f(*args)
return result
return main
def get_num(remains):
i = 0
while remains:
if remains & 1:
yield i
... | p00070 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | p00070 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | p00070 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0070
"""
import sys
import time
from itertools import permutations
def solve1(pick, target):
# ????´???????????????????????????§???????????????????????????
hit = 0
for nums in permutations([0, 1, 2, 3, 4, 5, 6... | p00070 |
import sys
def f0070(A,n,s):
if n==1: return (s in A)
c=0
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
N=list(range(n))
def f(A):
return sum([(i+1)*A[i] for i in N])
b1=f(A1)
b2=f(A2)
if b1<=s<=b2:
for i in range(len(A)):
b=s-A[i]*n
c+=f0070(A[:i]+A[i+1:],n-1,b)
return ... | import sys
def f0070(A,n,s):
if n==1: return (s in A)
c=0
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
N=list(range(n))
def f(A):
return sum([(i+1)*A[i] for i in N])
if f(A1)<=s<=f(A2):
for i in range(len(A)):
b=s-A[i]*n
c+=f0070(A[:i]+A[i+1:],n-1,b)
return c
for a in sys.st... | p00070 |
import sys
def f0070(A,n,s):
if n==1:
if s in A:f=1
else:f=0
return f
c=0
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
N=list(range(n))
def f(A):
return sum([(i+1)*A[i] for i in N])
if f(A1)<=s<=f(A2):
for i in range(len(A)):
b=s-A[i]*n
c+=f0070(A[:i]+A[i+1:],n-1,... | import sys
def f0070(A,n,s):
if n==1:return s in A
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
N=list(range(n))
b1=0
b2=0
c=0
for i in N:
b1+=(i+1)*A1[i]
b2+=(i+1)*A2[i]
if b1<=s<=b2:
for i in range(len(A)):
b=s-A[i]*n
c+=f0070(A[:i]+A[i+1:],n-1,b)
return c
for a... | p00070 |
import sys
def f0070(A,n,s):
if n==1:return s in A
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
N=list(range(n))
b1=0
b2=0
c=0
for i in N:
b1+=(i+1)*A1[i]
b2+=(i+1)*A2[i]
if b1<=s<=b2:
for i in range(len(A)):
b=s-A[i]*n
c+=f0070(A[:i]+A[i+1:],n-1,b)
return c
for a... | import sys
def f0070(A,n,s):
if n==1:return s in A
A=sorted(A)
A1=A[:n][::-1]
A2=A[-n:]
b1=0
b2=0
c=0
j=1
for i in range(n):
b1+=j*A1[i]
b2+=j*A2[i]
j+=1
if b1<=s<=b2:
for i in range(len(A)):
c+=f0070(A[:i]+A[i+1:],n-1,s-A[i]*n)
return c
for a in sys.stdin:
... | p00070 |
H, W = list(map(int, input().split()))
a = [input().strip() for _ in range(H)]
a = list(map(''.join, list(zip(*a))))
ans = 0
def solve(a, c):
shift = [[0] * (H+1) for _ in range(H+1)]
for i in reversed(range(H)):
for j in reversed(range(H)):
shift[i][j] = shift[i+1][j+1] + int(a[H-1-... | H, W = list(map(int, input().split()))
a = [input().strip() for _ in range(H)]
a = list(map(''.join, list(zip(*a))))
ans = 0
def solve(a, c):
shift = [[0] * (H+1) for _ in range(H+1)]
for i in reversed(range(H)):
for j in reversed(range(H)):
shift[i][j] = shift[i+1][j+1] + int(a[H-1-... | p03960 |
n,m = list(map(int,input().split()))
a = [input().rstrip() for i in range(n)]
b = list(zip(*a))
for i in range(m):
b[i] = "".join(b[i])
ans = 0
ct1 = [[0 for k in range(n-j+1)] for j in range(n+1)]
ct2 = [[0 for k in range(n-j+1)] for j in range(n+1)]
for i in range(m-1):
b1 = b[i]
b2 = b[i+1]
for j ... | n,m = list(map(int,input().split()))
a = [input().rstrip() for i in range(n)]
b = list(zip(*a))
for i in range(m):
b[i] = "".join(b[i])
ans = 0
ct1 = [[0 for k in range(n-j+1)] for j in range(n+1)]
ct2 = [[0 for k in range(n-j+1)] for j in range(n+1)]
dp = [[10**5 for i in range(n+1)] for j in range(n+1)]
fo... | p03960 |
from math import sqrt
for i in range(int(eval(input()))):
a, b = list(map(int, input().split()))
if not a < b:
a, b = b, a
ans = (a-1)*2 + (a < b-1)
c = int(sqrt(a*b))
if c**2 == a*b:
c -= 1
if a < c:
if (a*b) % c == 0:
d = (a*b)//c - 1
els... | # seishin.py
from math import sqrt
Q = int(eval(input()))
for i in range(Q):
a, b = list(map(int, input().split()))
if not a < b:
a, b = b, a
if a == b or a+1 == b:
print((2*a-2))
continue
c = int(sqrt(a*b))
if c**2 == a*b:
c -= 1
if c*(c+1) >= a*b:
... | p03390 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
a = list(map(int,readline().split()))
s = a[0]+a[1]
if n == 2:
if a[0] < a[1] or s%2 == 1:
print((-1))
else:
print((a[0]-s//2))
exit()
c = 0
for i in ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
a = list(map(int,readline().split()))
s = a[0]+a[1]
if n == 2:
if a[0] < a[1] or s%2 == 1:
print((-1))
else:
print((a[0]-s//2))
exit()
c = 0
for i in ... | p02626 |
import sys
sys.setrecursionlimit(10**7)
INF=10**18
def calc(a,b,xor):
if (a&1)^(b&1)!=(xor&1):
return INF
if xor==0:
if a<b:
return INF
else:
return (a-b)//2
x=2*calc(a//2,b//2,xor//2)
y=2*calc((a-1)//2,(b+1)//2,xor//2)+1
return min(x,y)
n=int(eval(input()))
arr=list... | INF=10**18
def calc(a,b,xor):
if (a,b,xor) in memo:
return memo[(a,b,xor)]
if (a&1)^(b&1)!=(xor&1):
return INF
if xor==0:
if a<b:
return INF
else:
return (a-b)//2
x=2*calc(a//2,b//2,xor//2)
y=2*calc((a-1)//2,(b+1)//2,xor//2)+1
memo[(a,b,xor)]=min(x,y)
return memo[... | p02626 |
from functools import reduce
from collections import defaultdict
N = int(eval(input()))
A = list(map(int,input().split()))
r = reduce(lambda x,y : x^y , A[2:],0)
a,b = A[:2]
def answer(ta,tb,tr):
for i in range(ta):
if (ta-i)^(tb+i) == tr:
ans = i
break
else:
... | from functools import reduce
from collections import defaultdict
N = int(eval(input()))
A = list(map(int,input().split()))
r = reduce(lambda x,y : x^y , A[2:],0)
a,b = A[:2]
def answer(ta,tb,tr):
for i in range(ta):
if (ta-i)^(tb+i) == tr:
ans = i
break
else:
... | p02626 |
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
ALL = 0
for a in A:
ALL ^= a
ALL ^= A[0] ^ A[1]
for i in range(A[0]):
if ALL ^ (A[0] - i) ^ (A[1] + i) == 0:
print(i)
sys.exit()
print((-1)) | import sys
N = int(eval(input()))
A = list(map(int,input().split()))
ALL = 0
for a in A:
ALL ^= a
if ALL == 0:
print((0))
sys.exit()
ALL ^= A[0] ^ A[1]
K = A[0] + A[1]
L = []
for i in range(40, -1, -1):
if (1 << i) & ALL:
L.append(1)
K -= (1 << i)
else:
... | p02626 |
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print((-1))
return
d >>= 1
if d&x... | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(eval(input()))
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print((-1))
return
d >>= 1
if d&x... | p02626 |
def main(n,a):
s=a[0]+a[1]
z=0
for ai in a[2:]:
z^=ai
# i+j=s,i<=a[0],i^j=z となるi,jを探す
# i+j=i^j+2*(i & j)
# s = z + 2*(i & j)
# i & j = (s-z)/2 = d
# z = 2*(i & j) - s = i ^ j
# d = (s-z) / 2
# z = x^y , x&y=0
# d^x,d^yは条件を満たす。d^x+d^y=d^x^d^y + 2*((d^x)&... | def main(n,a):
s=a[0]+a[1]
z=0
for ai in a[2:]:
z^=ai
# i+j=s,i<=a[0],i^j=z となるi,jを探す
# i+j=i^j+2*(i & j)
# s = z + 2*(i & j)
# i & j = (s-z)/2 = d
# z = 2*(i & j) - s = i ^ j
# d = (s-z) / 2
# z = x^y , x&y=0
# d^x,d^yは条件を満たす。d^x+d^y=d^x^d^y + 2*((d^x)&(d... | p02626 |
N = int(eval(input()))
A = list(map(int, input().split()))
a, b = A[0], A[1]
X = 0
for i in range(2, N):
X ^= A[i]
S = a + b
M = 42
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 0
v = 1
for i in range(M):
cs = S & 1
cx = X & 1
ca = a & 1
for j in range(2)... | N = int(eval(input()))
A = list(map(int, input().split()))
# a = A_1, b = A_2, x = A_3 ^ ... ^ A_N, s = a + b とする
a, b = A[0], A[1]
x = 0
for i in range(2, N):
x ^= A[i]
s = a + b
M = 42
# dp[桁][繰り上げフラグ][これまでの桁でAより大きいフラグ] := Aとなり得る値の最大値
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][... | p02626 |
N = int(eval(input()))
A = list(map(int, input().split()))
A3 = 0
for i in range(2, N):
A3 ^= A[i]
ans = -1
for i in range(A[0]):
if (A[0] - i) ^ (A[1] + i) == A3:
ans = i
break
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
P = 41
X = 0
for i in range(2, N):
X ^= A[i]
S = A[0] + A[1]
A1 = A[0]
D, M = divmod(S - X, 2)
ans = -1
if M % 2 == 0 and D & X == 0 and D <= A1:
Y = 0
for p in range(P, -1, -1):
if (X >> p) & 1 == 1:
new_Y = ... | p02626 |
mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
if N == 2:
if A[0] == A[1]:
print((0))
elif A[0] < A[1]:
print((-1))
else:
if (A... | mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
if N == 2:
if A[0] == A[1]:
print((0))
elif A[0] < A[1]:
print((-1))
else:
if (A... | p02626 |
N = int(eval(input()))
A = list(map(int, input().split()))
xor = 0
for a in A[2:]:
xor ^= a
n = A[0] + A[1] - xor
if n < 0 or n%2:
print((-1))
quit()
n //= 2
a = b = 0
digit = [1]
d = []
count = 0
while n or xor:
n0 = n & 1; xor0 = xor & 1
if n0:
if xor0:
... | N = int(eval(input()))
A = list(map(int, input().split()))
xor = 0
for a in A[2:]:
xor ^= a
n = A[0] + A[1] - xor
if n < 0 or n%2:
print((-1))
quit()
n //= 2
a = b = 0
digit = 1
d = []
while n or xor:
n0 = n & 1; xor0 = xor & 1
if n0:
if xor0:
print((-1))
... | p02626 |
from functools import lru_cache
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
t = 0
for x in X:
t = t^x
inf = float('inf')
@lru_cache(None)
def it(x, y, z):
xm, ym, zm = x%2, y%2, z%2
if xm ^ ym != zm:
return inf
if x^y == z:
return 0
Rz = 2*i... | import sys
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
S = X[0]+X[1]
T = 0
for i in range(2, N):
T ^= X[i]
if S<T or (S-T)%2:
print((-1))
sys.exit()
D = (S-T)//2
if D&T:
print((-1))
sys.exit()
M = T.bit_length()+1
if D > X[0]:
print((-1))
sys.exi... | p02626 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.