input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,ma,mb=list(map(int,input().split()))
inf=float("inf")
A=[]
append=A.append
for i in range(n):
a,b,c=list(map(int,input().split()))
append([a,b,c])
DP=[[[inf]*(10*n+1) for _ in range(10*n+1)] for _ in range(n+1)]
DP[0][0][0]=0
for i in range(n):
a,b,c=A[i][0],A[i][1],A[i][2]
for j in range(10*(i+1)+1):
for k in range(10*(i+1)+1):
if j>=a and k>=b:
DP[i+1][j][k]=min(DP[i][j-a][k-b]+c,DP[i][j][k])
else:
DP[i+1][j][k]=DP[i][j][k]
ans=inf
for i in range(10*n+1):
for j in range(10*n+1):
if i*mb==j*ma and i*j!=0:
ans=min(ans,DP[n][i][j])
print((ans if ans!=inf else -1)) | n,ma,mb=list(map(int,input().split()))
inf=10**4
A=[]
append=A.append
for i in range(n):
a,b,c=list(map(int,input().split()))
append([a,b,c])
DP=[[[inf]*(10*n+1) for _ in range(10*n+1)] for _ in range(n+1)]
DP[0][0][0]=0
for i in range(n):
a,b,c=A[i][0],A[i][1],A[i][2]
for j in range(10*(i+1)+1):
for k in range(10*(i+1)+1):
if j>=a and k>=b:
DP[i+1][j][k]=min(DP[i][j-a][k-b]+c,DP[i][j][k])
else:
DP[i+1][j][k]=DP[i][j][k]
ans=inf
for i in range(10*n+1):
for j in range(10*n+1):
if i*mb==j*ma and i*j!=0:
ans=min(ans,DP[n][i][j])
print((ans if ans!=inf else -1)) | p03806 |
n,ma,mb=list(map(int,input().split()))
inf=10**4
A=[]
append=A.append
for i in range(n):
a,b,c=list(map(int,input().split()))
append([a,b,c])
DP=[[[inf]*(10*n+1) for _ in range(10*n+1)] for _ in range(n+1)]
DP[0][0][0]=0
for i in range(n):
a,b,c=A[i][0],A[i][1],A[i][2]
for j in range(10*(i+1)+1):
for k in range(10*(i+1)+1):
if j>=a and k>=b:
DP[i+1][j][k]=min(DP[i][j-a][k-b]+c,DP[i][j][k])
else:
DP[i+1][j][k]=DP[i][j][k]
ans=inf
for i in range(10*n+1):
for j in range(10*n+1):
if i*mb==j*ma and i*j!=0:
ans=min(ans,DP[n][i][j])
print((ans if ans!=inf else -1)) | n,ma,mb=list(map(int,input().split()))
inf=10**4
A=[]
append=A.append
for i in range(n):
a,b,c=list(map(int,input().split()))
append([a,b,c])
DP=[[[inf]*(10*n+1) for _ in range(10*n+1)] for _ in range(n+1)]
DP[0][0][0]=0
for i in range(n):
a,b,c=A[i][0],A[i][1],A[i][2]
for j in range(10*(i+1)+1):
for k in range(10*(i+1)+1):
if j>=a and k>=b:
DP[i+1][j][k]=min(DP[i][j-a][k-b]+c,DP[i][j][k])
else:
DP[i+1][j][k]=DP[i][j][k]
ans=inf
for i in range(1,10*n+1):
if i*mb%ma==0 and i*mb//ma<10*n+1:
j=i*mb//ma
ans=min(ans,DP[n][i][j])
print((ans if ans!=inf else -1)) | p03806 |
n, ma, mb = list(map(int, input().split()))
a = [0] * n
b = [0] * n
c = [0] * n
for i in range(n):
a[i], b[i], c[i] = list(map(int, input().split()))
M = 401
INF = 10 ** 15
min_cost = [[INF] * M for k in range(M)]
min_cost[0][0] = 0
for k in range(n):
for i in range(M - 1, a[k]-1, -1):
for j in range(M - 1, b[k] - 1, -1):
cc = min_cost[i - a[k]][j - b[k]] + c[k]
if cc < min_cost[i][j]:
min_cost[i][j] = cc
res = INF
for i in range(1, M):
for j in range(1, M):
if i * mb == j * ma:
if min_cost[i][j] < res:
res = min_cost[i][j]
if res == INF:
res = -1
print(res)
|
n, ma, mb = list(map(int, input().split()))
a = [0] * n
b = [0] * n
c = [0] * n
for i in range(n):
a[i], b[i], c[i] = list(map(int, input().split()))
M = 401
INF = 10 ** 15
min_cost = [[INF] * M for k in range(M)]
s = set()
min_cost[0][0] = 0
s.add((0, 0))
for k in range(n):
ss = set(s)
for i, j in reversed(sorted(s)):
if i + a[k] < M and j + b[k] < M:
cc = min_cost[i][j] + c[k]
if cc < min_cost[i + a[k]][j + b[k]]:
ss.add((i + a[k], j + b[k]))
min_cost[i + a[k]][j + b[k]] = cc
s = ss
res = INF
for i in range(1, M):
for j in range(1, M):
if i * mb == j * ma:
if min_cost[i][j] < res:
res = min_cost[i][j]
if res == INF:
res = -1
print(res)
| p03806 |
n,ma,mb=list(map(int,input().split()))
el=[list(map(int,input().split())) for i in range(n)]
sa=sum(i[0] for i in el)
sb=sum(i[1] for i in el)
#mi=min(sa//ma,sb//mb)
inf=10000000000
x=[[inf for j in range(sb+1)] for i in range(sa+1)]
x[0][0]=0
for i in range(n):
now=el[i]
x_sub=[[0 for j in range(sb+1)] for i in range(sa+1)]
for k in range(sa+1):
for l in range(sb+1):
if x[k][l]!=inf and k+now[0]<sa+1 and l+now[1]<sb+1:
x_sub[k+now[0]][l+now[1]]=x[k][l]+now[2]
for k in range(sa+1):
for l in range(sb+1):
if x_sub[k][l]!=0:
x[k][l]=min(x[k][l],x_sub[k][l])
mi=min(sa//ma,sb//mb)
ans=inf
for i in range(1,mi+1):
ans=min(ans,x[ma*i][mb*i])
if ans==inf:
print((-1))
else:
print(ans)
| n,ma,mb=list(map(int,input().split()))
el=[list(map(int,input().split())) for i in range(n)]
sa=sum(i[0] for i in el)
sb=sum(i[1] for i in el)
sa1=sa+1
sb1=sb+1
inf=10000000000
x=[[inf]*(sb1) for i in range(sa1)]
x[0][0]=0
for i in range(n):
now=el[i]
x_sub=[[0]*(sb1) for i in range(sa1)]
for k in range(sa1):
for l in range(sb1):
if x[k][l]!=inf:
if k+now[0]<sa1:
if l+now[1]<sb1:
x_sub[k+now[0]][l+now[1]]=x[k][l]+now[2]
for k in range(sa1):
for l in range(sb1):
if x_sub[k][l]!=0:
x[k][l]=min(x[k][l],x_sub[k][l])
mi=min(sa//ma,sb//mb)
ans=inf
for i in range(1,mi+1):
ans=min(ans,x[ma*i][mb*i])
if ans==inf:
print((-1))
else:
print(ans)
| p03806 |
from copy import deepcopy
n,ma,mb=list(map(int,input().split()))
el=[list(map(int,input().split())) for i in range(n)]
sa=sum(i[0] for i in el)
sb=sum(i[1] for i in el)
sa1=sa+1
sb1=sb+1
inf=10000000000
x=[[inf]*(sb1) for i in range(sa1)]
y=[[0]*(sb1) for i in range(sa1)]
x[0][0]=0
for i in range(n):
now=el[i]
x_sub=deepcopy(y)
for k in range(sa1):
for l in range(sb1):
if x[k][l]!=inf:
if k+now[0]<sa1:
if l+now[1]<sb1:
x_sub[k+now[0]][l+now[1]]=x[k][l]+now[2]
for k in range(sa1):
for l in range(sb1):
if x_sub[k][l]!=0:
x[k][l]=min(x[k][l],x_sub[k][l])
mi=min(sa//ma,sb//mb)
ans=inf
for i in range(1,mi+1):
ans=min(ans,x[ma*i][mb*i])
if ans==inf:
print((-1))
else:
print(ans)
| n,ma,mb=list(map(int,input().split()))
el=[list(map(int,input().split())) for i in range(n)]
sa=sum(i[0] for i in el)
sb=sum(i[1] for i in el)
sa1=sa+1
sb1=sb+1
inf=1000000
x=[[inf]*(sb1) for i in range(sa1)]
x[0][0]=0
for i in range(n):
now=el[i]
x_sub=[[0]*(sb1) for i in range(sa1)]
for k in range(sa1):
for l in range(sb1):
if x[k][l]!=inf:
if k+now[0]<sa1:
if l+now[1]<sb1:
x_sub[k+now[0]][l+now[1]]=x[k][l]+now[2]
for k in range(sa1):
for l in range(sb1):
if x_sub[k][l]!=0:
x[k][l]=min(x[k][l],x_sub[k][l])
mi=min(sa//ma,sb//mb)
ans=inf
for i in range(1,mi+1):
ans=min(ans,x[ma*i][mb*i])
if ans==inf:
print((-1))
else:
print(ans)
| p03806 |
N, Ma, Mb = list(map(int, input().split()))
a = [[0, 0, 0] for _ in range(N)]
sa = 0
sb = 0
for i in range(N):
a[i][0], a[i][1], a[i][2] = list(map(int, input().split()))
sa += a[i][0]
sb += a[i][1]
INF = 1000000
DP = [[[INF for _ in range(sb+1)] for _ in range(sa+1)] for _ in range(N+1)]
DP[0][0][0] = 0
for i in range(N):
for j in range(sa+1):
for k in range(sb+1):
if(j >= a[i][0] and k >= a[i][1]):
DP[i+1][j][k] = min(DP[i][j-a[i][0]][k-a[i][1]] + a[i][2], DP[i][j][k])
else:
DP[i+1][j][k] = DP[i][j][k]
ans = INF
for i in range(1, min(sa//Ma, sb//Mb)+1):
ans = min(ans, DP[N][Ma*i][Mb*i])
if(ans == INF):
print((-1))
else:
print(ans) | def main():
N, Ma, Mb = list(map(int, input().split()))
yakuhin = []
sa = 0
sb = 0
for i in range(N):
yakuhin.append(list(map(int, input().split())))
sa += yakuhin[i][0]
sb += yakuhin[i][1]
INF = 10**15
DP = [[[INF for _ in range(sb+1)] for _ in range(sa+1)] for _ in range(N+1)]
for i in range(N):
DP[i][0][0] = 0
for i in range(N):
for j in range(sa+1):
for k in range(sb+1):
if(j >= yakuhin[i][0] and k >= yakuhin[i][1]):
DP[i+1][j][k] = min(DP[i][j][k], DP[i][j-yakuhin[i][0]][k-yakuhin[i][1]]+yakuhin[i][2])
else:
DP[i+1][j][k] = min(DP[i+1][j][k], DP[i][j][k])
ans = INF
for i in range(1, N+1):
for j in range(1, sa+1):
for k in range(1, sb+1):
if(j*Mb == k*Ma):
ans = min(ans, DP[i][j][k])
print((ans if ans != INF else -1))
main() | p03806 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
N,K = list(map(int,input().split()))
A = sorted([int(input()) for i in range(0,K)])
if (N,K) == (0,0):
break
if A[0] == 0:
flag = True
A = A[1:]
K -= 1
else:
flag = False
ans = 0
for i in range(K):
for j in range(i+ans,K):
if j - i == A[j] - A[i]:
ans = max(ans,A[j]-A[i])
elif flag is True and j - i + 1 == A[j] - A[i]:
ans = max(ans,A[j]-A[i])
else:
break
print((ans+1)) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
N,K = list(map(int,input().split()))
A = sorted([int(eval(input())) for i in range(0,K)])
if (N,K) == (0,0):
break
if A[0] == 0:
flag = True
A = A[1:]
K -= 1
else:
flag = False
ans = 0
count = 0
diff_list = []
s = 0
for i in range(1,K):
if A[i] - A[i-1] == 2:
diff_list.append(A[i-1] - A[s])
s = i
count = 0
elif A[i] - A[i-1] > 2:
diff_list.append(A[i-1] - A[s])
diff_list.append(0)
s = i
count = 0
else:
count += 1
ans = max(ans,count)
else:
diff_list.append(A[i] - A[s])
if flag is True:
ans = 0
for i in range(1,len(diff_list)):
ans = max(ans,diff_list[i] + diff_list[i-1] + 2)
print((ans + 1)) | p00440 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
N,K = list(map(int,input().split()))
A = sorted([int(eval(input())) for i in range(0,K)])
if (N,K) == (0,0):
break
if A[0] == 0:
flag = True
A = A[1:]
K -= 1
else:
flag = False
ans = 0
count = 0
diff_list = []
s = 0
for i in range(1,K):
if A[i] - A[i-1] == 2:
diff_list.append(A[i-1] - A[s])
s = i
count = 0
elif A[i] - A[i-1] > 2:
diff_list.append(A[i-1] - A[s])
diff_list.append(0)
s = i
count = 0
else:
count += 1
ans = max(ans,count)
else:
diff_list.append(A[i] - A[s])
if flag is True:
ans = 0
for i in range(1,len(diff_list)):
ans = max(ans,diff_list[i] + diff_list[i-1] + 2)
print((ans + 1)) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
N,K = list(map(int,input().split()))
A = sorted([int(input()) for i in range(0,K)])
if (N,K) == (0,0):
break
if A[0] == 0:
flag = True
A = A[1:]
K -= 1
else:
flag = False
ans = 0
count = 0
diff_list = []
s = 0
for i in range(1,K):
if A[i] - A[i-1] == 2:
diff_list.append(A[i-1] - A[s])
s = i
count = 0
elif A[i] - A[i-1] > 2:
diff_list.append(A[i-1] - A[s])
diff_list.append(0)
s = i
count = 0
else:
count += 1
ans = max(ans,count)
else:
diff_list.append(A[i] - A[s])
if flag is True:
ans = 0
for i in range(1,len(diff_list)):
ans = max(ans,diff_list[i] + diff_list[i-1] + 2)
print((ans + 1)) | p00440 |
while 1:
n,k = list(map(int,input().split()))
s = [0]*(n+1)
ss = [0]*(n+1)
if n == 0: break
c = sorted([int(input()) for i in range(k)])
if c[0] == 0:
for i in c[1:]:
s[i] = s[i-1]+1
ss[i] = ss[i-1]+1
if s[i-1] == 0 and s[i-2] > 0:
ss[i] = s[i] + s[i-2] + 1
print(max(ss))
else:
for i in c:
s[i] = s[i-1] + 1
print(max(s)) | while 1:
n,k = list(map(int,input().split()))
s = [0]*(n+1)
if n == 0: break
c = sorted([int(input()) for i in range(k)])
have0 = 1 if c[0] == 0 else 0
jump = 0
for i in c[have0:]:
s[i] = s[i-1] + 1
if have0 and s[i-1] == 0 and s[i-2] > 0:
s[i] += s[i-2] + 1 - jump
jump = s[i-2] + 1
if s[i-1] == 0 and s[i-2] == 0:
jump = 0
print(max(s)) | p00440 |
while True:
n = int(eval(input()))
if not n: break
count = 0
flag = -1
lst = [0]
for i in range(n):
a = int(eval(input()))
if flag == a:
lst[-1] += 1
else:
if i % 2 == 0:
lst.append(1)
flag = a
else:
if len(lst) == 1:
lst[-1] += 1
flag = a
elif len(lst) >= 2:
lst.append(lst.pop() + lst.pop() + 1)
flag = a
ans = 0
if flag == 0:
for i in range(-1,len(lst) * (-1) - 1,-2):
ans += lst[i]
elif flag == 1:
for i in range(-2,len(lst) * (-1) - 1,-2):
ans += lst[i]
print(ans)
| def main():
while True:
n = int(eval(input()))
if not n: break
flag = -1
lst = []
for i in range(n):
a = int(eval(input()))
if flag == a:
lst[-1] += 1
else:
if i % 2 == 0:
lst.append(1)
flag = a
else:
if len(lst) == 1:
lst[-1] += 1
flag = a
elif len(lst) >= 2:
lst[-2] = lst[-2] + lst[-1] + 1
lst.pop()
flag = a
ans = 0
if flag == 0:
for i in range(-1,len(lst) * (-1) - 1,-2):
ans += lst[i]
elif flag == 1:
for i in range(-2,len(lst) * (-1) - 1,-2):
ans += lst[i]
print(ans)
main()
| p00450 |
n, m = list(map(int, input().split()))
ans = -1
mod = pow(10, 9) + 7
if abs(n-m) > 1:
ans = 0
else:
if abs(n-m) == 0:
a = 1
for i in range(1, n+1):
a *= i
ans = a*a*2
if abs(n-m) == 1:
a = 1
for i in range(1, min(n, m)+1):
a *= i
b = a * max(n, m)
ans = a * b
print((ans%mod))
| import math
n, m = list(map(int, input().split()))
ans = -1
mod = pow(10, 9) + 7
if abs(n-m) > 1:
ans = 0
else:
if abs(n-m) == 0:
a = math.factorial(n)
ans = a*a*2
if abs(n-m) == 1:
a = math.factorial(min(n, m))
b = a * max(n, m)
ans = a * b
print((ans%mod))
| p03681 |
n,m=list(map(int,input().split()))
mod=10**9+7
import sys
sys.setrecursionlimit(100002)
def kaijou(x):
if x==1:
return 1
else:
return ((x%mod)*kaijou(x-1))%mod
if abs(m-n)==1:
n2=kaijou(n)
m2=kaijou(m)
print(((n2*m2)%mod))
elif abs(m-n)==0:
n2=kaijou(n)
m2=kaijou(m)
print((2*(n2*m2)%mod))
else:
print((0)) | n,m=list(map(int,input().split()))
mod=10**9+7
nkai=1
mkai=1
for i in range(1,n+1):
nkai*=(i%mod)
nkai=(nkai%mod)
for i in range(1,m+1):
mkai*=(i%mod)
mkai=(mkai%mod)
if abs(n-m)>=2:
print((0))
elif abs(n-m)==1:
print(((mkai*nkai)%mod))
elif abs(n-m)==0:
print(((mkai*nkai*2)%mod)) | p03681 |
N, M = list(map(int, input().split()))
ans = 0
def func(n):
sum = 1
for i in range(1, n+1):
sum *= i
return sum % (10**9 + 7)
if abs(N - M) == 0:
ans = 2 * func(N)*func(M)
elif abs(N - M) == 1:
ans = func(N)*func(M)
print((ans % (10**9 + 7)))
| N, M = list(map(int, input().split()))
ans = 0
MOD = 10**9 + 7
def func(n):
sum = 1
for i in range(1, n+1):
sum = sum*i % MOD
return sum
if abs(N - M) == 0:
ans = 2 * func(N)*func(M)
elif abs(N - M) == 1:
ans = func(N)*func(M)
print((ans % MOD))
| p03681 |
import sys
res=10**9+7
def permutation(n):
x=1
for i in range(n):x=(x*(i+1))
return(x)
n,m=list(map(int,input().split()))
n%=res
m%=res
if(n>m+1 or m>n+1):
print((0))
elif(n==m):
p=permutation(n)
print(((2*p*p)%res))
else:
ma=max(n,m)
p=permutation(ma)
p2=p//ma
print(((p*p2)%res))
| import sys
res=10**9+7
def permutation(n):
x=1
for i in range(n):x=(x*(i+1))%res
return(x%res)
n,m=list(map(int,input().split()))
n%=res
m%=res
if(n>m+1 or m>n+1):
print((0))
elif(n==m):
p=permutation(n)
print(((2*p*p)%res))
else:
mi=min(n,m)
p=permutation(mi)
p2=p*max(n,m)
print(((p*p2)%res))
| p03681 |
def kaijo(n):
fact = 1
for i in range(1, n+1):
fact *=i
return fact
n, m=list(map(int, input().split()))
if n-m>=2 or m-n>=2:
print((0))
elif n!=m:
print((kaijo(m)*kaijo(n)%(10**9+7)))
else:
print((2*kaijo(m)*kaijo(n)%(10**9+7))) | import math
n, m=list(map(int, input().split()))
if n-m>=2 or m-n>=2:
print((0))
elif n!=m:
print((math.factorial(m)*math.factorial(n)%(10**9+7)))
else:
print((2*math.factorial(m)*math.factorial(n)%(10**9+7))) | p03681 |
import math
n,m = list(map(int, input().split()))
num_b = max([n,m]) #多い方
num_l = min([n,m]) #少ない方
ans = 0
if num_b - num_l >= 2: #差が2以上あると、隣接なしでは並べられない
ans = 0
elif num_b - num_l == 1:
#差が1匹の場合
#多い方が(num_b)!通り、少ない方が(num_l)!通りの並び方なので、その積をとる
ans = math.factorial(num_b) * math.factorial(num_l) % (10 ** 9 + 7)
else:
#差が0匹の場合
#一方を先に並べる。(num_b)!通り。もう一方をまず間に入れる。(num_l - 1)匹選ぶ方法がnum_l通りで並べ方が(num_l - 1)!通り残りを左右のどちらに置くかで2通り
ans = math.factorial(num_b) * num_l * math.factorial(num_l - 1) * 2 % (10 ** 9 + 7)
print(ans) |
N,M = list(map(int, input().split()))
MOD = 10**9+7
if abs(N - M) > 1:
print((0))
exit()
factorial = [1] * (max(N,M)+1)
for i in range(1,max(N,M)+1):
factorial[i] = (factorial[i-1]*i) % MOD
if abs(N - M) == 0:
ans = ((factorial[N]**2) * 2) % MOD
else:
ans = (factorial[N] * factorial[M]) % MOD
print(ans) | p03681 |
n,m=list(map(int,input().split()))
mod=10**9+7
import math
a=math.factorial(n)*math.factorial(m)
if abs(n-m)==0:
print((2*a%mod))
exit()
if abs(n-m)>1:
print((0))
exit()
print(a) | import math
n,m=list(map(int,input().split()))
a=math.factorial(n) * math.factorial(m)
if abs(n-m) == 0:
a *= 2
elif abs(n-m) > 1:
a = 0
print((a%1000000007))
| p03681 |
n,m=list(map(int,input().split()))
import math
a=math.factorial(n) * math.factorial(m)
if abs(n-m) == 0:
a *= 2
elif abs(n-m) > 1:
a = 0
print((a%1000000007))
| import math
n,m=list(map(int,input().split()))
mod=10**9+7
a=math.factorial(n)*math.factorial(m)
if abs(n-m)==0:
print((2*a%mod))
exit()
elif abs(n-m)>1:
a=0
print((a%mod))
| p03681 |
from math import factorial
n, m = list(map(int, input().split()))
if n == m:
ans = factorial(n) % (10 ** 9 + 7)
ans = ans ** 2 % (10 ** 9 + 7)
print((ans * 2 % (10 ** 9 + 7)))
elif abs(n - m) == 1:
ans1 = factorial(n) % (10 ** 9 + 7)
ans2 = factorial(m) % (10 ** 9 + 7)
print((ans1 * ans2 % (10 ** 9 + 7)))
else:
print((0)) | from math import factorial
mod = 10 ** 9 + 7
n, m = list(map(int, input().split()))
print((
((factorial(n) % mod) ** 2 % mod) * 2 % mod
if n == m
else (factorial(n) % mod) * (factorial(m) % mod) % mod
if abs(n - m) == 1
else 0
)) | p03681 |
def fct(x):
t = int(1)
for i in range(1, x+1):
t = t * int(i)
return t
inpt = list(map(int, input().split()))
n = inpt[0]
m = inpt[1]
ans = int(0)
if abs(n-m) < 2:
ans = fct(n)*fct(m)
if n == m:
ans = 2 * ans
print(ans) | def fct(x):
t = 1
for i in range(1, x+1):
t = (t * int(i)) % 1000000007
return t
inpt = list(map(int, input().split()))
n = inpt[0]
m = inpt[1]
ans = 0
if abs(n-m) < 2:
ans = (fct(n)*fct(m)) % 1000000007
if n == m:
ans = (2 * ans) % 1000000007
print(ans) | p03681 |
import sys
n,m = list(map(int,input().split()))
if abs(n-m) >= 2:
print((0))
sys.exit()
if abs(n-m) == 1:
x = max(n,m)
for i in range(1,min(n,m)+1):
x = x*i**2 % (10**9 + 7)
else:
x = 2
for i in range(1,n+1):
x = x*i**2 % (10**9 + 7)
print(x) | n,m = list(map(int,input().split()))
if abs(n-m) >= 2:
print((0))
elif abs(n-m) == 1:
x = max(n,m)
for i in range(1,min(n,m)+1):
x = x*i**2 % (10**9 + 7)
print(x)
else:
x = 2
for i in range(1,n+1):
x = x*i**2 % (10**9 + 7)
print(x) | p03681 |
def factorial(n):
p = 1
for i in range(1, n+1):
p *= i
return p
n, m = list(map(int, input().split()))
ans = 0
if abs(n-m) == 1:
ans = factorial(n) * factorial(m)
elif n == m:
ans = 2 * factorial(n) * factorial(m)
print((ans % (10 ** 9 + 7)))
| n, m = list(map(int, input().split()))
ans = 0
d = [0] * (max([n,m])+1)
def factorial(n):
global d
d[0] = 1
for i in range(1, n+1):
d[i] = ((i+1) * d[i-1]) % (10** 9 +7)
factorial(max(m,n))
if abs(n-m) == 1:
ans = d[n-1] * d[m-1]
elif n == m:
ans = 2 * d[n-1] * d[m-1]
print((ans % (10 ** 9 + 7)))
| p03681 |
import itertools
N, M = list(map(int, input().split()))
np = len(list(itertools.permutations(list(range(N))))) % (10**9+7)
mp = len(list(itertools.permutations(list(range(M))))) % (10**9+7)
if N == M:
ans = np*mp % (10**9+7)*2
elif abs(N - M) == 1:
ans = np * mp % (10 ** 9 + 7)
else:
ans = 0
print(ans) | N, M = list(map(int, input().split()))
mod = 10**9+7
def for_factorial(n):
mod = 10**9+7
val = 1
for i in range(2, n + 1):
val = (val*i) % mod
return val
f = for_factorial(N)*for_factorial(M) % mod
if N == M:
ans = f*2 % mod
elif abs(N - M) == 1:
ans = f % mod
else:
ans = 0
print(ans) | p03681 |
import sys
from math import factorial
sys.setrecursionlimit(500000)
N, M = list(map(int, input().split()))
MOD = 10**9 + 7
diff = abs(N - M)
if diff == 0:
ans = (factorial(N) * factorial(M)) * 2
elif diff == 1:
ans = factorial(N) * factorial(M)
else:
ans = 0
ans %= MOD
print(ans) | def fact(n):
ret = 1
MOD = 10**9 + 7
for i in range(1, n + 1):
ret = ret * i % MOD
return ret
N, M = list(map(int, input().split()))
MOD = 10**9 + 7
diff = abs(N - M)
if diff == 0:
ans = (fact(N) * fact(M)) * 2
elif diff == 1:
ans = fact(N) * fact(M)
else:
ans = 0
ans %= MOD
print(ans) | p03681 |
n,m=list(map(int,input().split()))
MOD = 1000000007
if abs(n-m) > 1:
print((0))
exit(0)
else:
n_cnt,m_cnt=1,1
for i in range(1,n+1):
n_cnt*=i
n_cnt%=MOD
for i in range(1,m+1):
m_cnt*=i
m_cnt%=MOD
if abs(n-m) == 0:
ans=n_cnt*m_cnt*2
else:
ans=n_cnt*m_cnt
print((ans%MOD)) | n, m = list(map(int, input().split()))
MOD = 1000000007
def nPk(n, k):
r = 1
while k > 0:
r *= n
r %= MOD
n -= 1
k -= 1
return r
if abs(n - m) > 1:
print((0))
elif n == m:
print((nPk(n, n) * nPk(m, m) * 2 % MOD))
else:
print((nPk(n, n) * nPk(m, m) % MOD)) | p03681 |
from math import factorial
large_p = 10**9 + 7
def main():
n, m = list(map(int, input().split()))
if (abs(n-m)) >= 2:
print((0))
else:
np = factorial(n)
mp = factorial(m)
if abs(n-m) == 1:
r = (np * mp) % large_p
print(r)
else:
r = ((np * mp) * 2) % large_p
print(r)
if __name__ == '__main__':
main()
| large_p = 10**9 + 7
def main():
n, m = list(map(int, input().split()))
if (abs(n-m)) >= 2:
print((0))
else:
np = 1
for i in range(n,0,-1):
np = (np * i) % large_p
mp = 1
for i in range(m,0,-1):
mp = (mp * i) % large_p
if abs(n-m) == 1:
r = (np * mp) % large_p
print(r)
else:
r = ((np * mp) * 2) % large_p
print(r)
if __name__ == '__main__':
main()
| p03681 |
import math
a, b = list(map(int, input().split()))
fa = math.factorial(a)
fb = math.factorial(b)
if abs(a-b) >= 2:
print((0))
elif abs(a-b) == 1:
print((fa*fb))
elif abs(a-b) == 0:
print((2*(fa*fb))) | import math
a, b = list(map(int, input().split()))
fa = math.factorial(a)
fb = math.factorial(b)
mod = 10**9 + 7
fa %= mod
fb %= mod
k = fa*fb
if abs(a-b) >= 2:
print((0))
elif abs(a-b) == 1:
print((k%mod))
elif abs(a-b) == 0:
print(((2*k) % mod)) | p03681 |
import math
a, b = list(map(int, input().split()))
fa = math.factorial(a)
fb = math.factorial(b)
mod = 10**9 + 7
fa %= mod
fb %= mod
k = fa*fb
if abs(a-b) >= 2:
print((0))
elif abs(a-b) == 1:
print((k%mod))
elif abs(a-b) == 0:
print(((2*k) % mod)) | import sys
input = sys.stdin.readline
import math
def main():
n, m = input_list()
if abs(n-m) > 1:
print((0))
exit()
mod = 10**9 + 7
diff = abs(n-m)
if diff == 1:
ans = math.factorial(n) * math.factorial(m)
print((ans % mod))
else:
ans = 2 * (math.factorial(n) * math.factorial(m))
print((ans % mod))
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()))
if __name__ == "__main__":
main()
| p03681 |
from math import factorial as frac
N, M = list(map(int, input().split()))
INF = 10**9 + 7
if abs(N-M) > 1:
print((0))
elif abs(N-M) == 1:
print((frac(N)*frac(M)%INF))
else:
print((((frac(N)*frac(M))*2)%INF))
| from math import factorial as frac
N, M = list(map(int, input().split()))
MOD = 10**9 + 7
def nPk(n, k):
r = 1
while k > 0:
r *= n
r %= MOD
n -= 1
k -= 1
return r
if abs(N-M) > 1:
print((0))
elif N==M:
print((((nPk(N,N)*nPk(M,M))*2)%MOD))
else:
print((nPk(N,N)*nPk(M,M)%MOD))
| p03681 |
n,m=list(map(int,input().split()))
if abs(n-m)>1: print((0))
else:
mod=10**9+7
def fact(n):
ans=1
for i in range(n):
ans*=(i+1)
return ans%mod
ans=(fact(n)*fact(m))%mod
if n==m: print(((2*ans)%mod))
else: print(ans) | n,m=list(map(int,input().split()))
if abs(n-m)>1: print((0))
else:
mod=10**9+7
def fact(n):
ans=1
for i in range(n):
ans*=(i+1)
ans%=mod
return ans
ans=(fact(n)*fact(m))%mod
if n==m: print(((2*ans)%mod))
else: print(ans) | p03681 |
import math
n,m=[int(i) for i in input().split()]
if(abs(n-m)>1):
print((0))
exit()
def is_even(n):
if(n%2==0):
return True
else:
return False
if(is_even(n) and is_even(m) or not is_even(n) and not is_even(m)):
print((math.factorial(n)*math.factorial(m)*2))
exit()
else:
print((math.factorial(n)*math.factorial(m)))
exit()
# if(is_even(n) and is_even(m)):
# print(math.factorial(n)*math.factorial(m)*2)
# exit()
# elif(is_even(n) and not is_even(m)):
# print(math.factorial(n)*math.factorial(m))
# exit()
# elif(not is_even(n) and is_even(m)):
# print(math.factorial(m)*math.factorial(n))
# exit()
# elif(not is_even(n) and not is_even(m)):
# print(math.factorial(m)*math.factorial(n)*2)
# exit() | import math
n,m=[int(i) for i in input().split()]
if(abs(n-m)>1):
print((0))
exit()
def is_even(n):
if(n%2==0):
return True
else:
return False
if(is_even(n) and is_even(m) or not is_even(n) and not is_even(m)):
print((math.factorial(n)*math.factorial(m)*2%(10**9+7)))
exit()
else:
print((math.factorial(n)*math.factorial(m)%(10**9+7)))
exit()
# if(is_even(n) and is_even(m)):
# print(math.factorial(n)*math.factorial(m)*2)
# exit()
# elif(is_even(n) and not is_even(m)):
# print(math.factorial(n)*math.factorial(m))
# exit()
# elif(not is_even(n) and is_even(m)):
# print(math.factorial(m)*math.factorial(n))
# exit()
# elif(not is_even(n) and not is_even(m)):
# print(math.factorial(m)*math.factorial(n)*2)
# exit() | p03681 |
# C - Reconciled?
N, M = list(map(int, input().split()))
ans_N = 1
ans_M = 1
if abs(N - M) >= 2:
print((0))
else:
for i in range(N):
ans_N_1 = (M-i)*(N-i) % (10**9+7)
ans_N = ans_N * ans_N_1
for j in range(M):
ans_M_1 = (M-j)*(N-j) % (10**9+7)
ans_M = ans_M * ans_M_1
print((ans_N+ans_M)) | # C - Reconciled?
N, M = list(map(int, input().split()))
ans_N = 1
ans_M = 1
mod = 10**9+7
if abs(N - M) >= 2:
print((0))
else:
for i in range(N):
ans_N = ans_N * ((M - i) * (N - i)) % mod
for j in range(M):
ans_M = ans_M * ((M - j) * (N - j)) % mod
print(((ans_N+ans_M)% mod)) | p03681 |
from math import factorial
MOD = 10**9+7
N,M = list(map(int,input().split()))
ans = 0
if abs(N-M) > 1:
pass
elif abs(N-M) ==1:
ans = factorial(N)*factorial(M) % MOD
elif N==M:
ans = 2*factorial(N)*factorial(M) % MOD
print(ans) | from math import factorial
MOD = 10**9+7
N,M = list(map(int,input().split()))
ans = 0
if abs(N-M) > 1:
pass
elif abs(N-M) ==1:
ans = (factorial(N) % MOD * factorial(M) % MOD) % MOD
elif N==M:
ans = ( 2 * factorial(N) % MOD * factorial(M) % MOD) % MOD
print(ans) | p03681 |
import math
n,m = list(map(int,input().split()))
a = 1000000007
if not (0 <= abs(n-m) <= 1):
print((0))
exit()
if n == m:
num = 2
else:
num = 1
print((num*math.factorial(n)*math.factorial(m) % a)) | n,m = list(map(int,input().split()))
a = 10**9+7
if m > n:
n,m = m,n
if not (0 <= n-m <= 1):
print((0))
exit()
if n == m:
num = 2
n = 1
else:
num = 1
t = 1
for i in range(1,m+1):
t *= i
t %= a
print((num*t*t*n%a)) | p03681 |
N,M=list(map(int,input().split()))
div=10**9+7
tmp=1
K=min(N,M)
diff=abs(N-M)
for i in range(K):
tmp*=(i+1)%div
ans=max(0,(2-diff)*tmp*tmp*(1+K*diff))%div
print(ans) | N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
nn = 1
mm = 1
for i in range(1, N + 1):
nn = (nn * i) % MOD
for j in range(1, M + 1):
mm = (mm * j) % MOD
if abs(N - M) >= 2:
ans = 0
elif abs(N - M) == 1:
ans = (nn * mm) % MOD
else:
ans = (2 * nn * mm) % MOD
print(ans)
| p03681 |
n,m = list(map(int, input().split()))
mod = 10**9+7
def factorial(n):
val = 1
for i in range(2, n + 1):
val *= i
return val
if abs(n-m)>1:
print((0))
elif abs(n-m)==1:
print((factorial(max(m,n))**2//max(m,n)%mod))
else:
print((factorial(n)**2*2%mod))
| n,m = list(map(int, input().split()))
mod = 10**9+7
def factorial(n):
val = 1
for i in range(2, n + 1):
val *= i
val %= mod
return val
if abs(n-m)>1:
print((0))
elif abs(n-m)==1:
num = factorial(min(m,n))
print((num**2*max(m,n)%mod))
else:
num = factorial(m)
print((num**2*2%mod))
| p03681 |
from math import factorial
N, M = list(map(int, input().split()))
a = 10**9+7
if abs(N-M) >= 2:
print((0))
elif N == M:
print(((2*factorial(N)*factorial(M)) % a))
else:
print(((factorial(N)*factorial(M)) % a))
| def factorial(n):
ans = 1
for i in range(2, n + 1):
ans = ans * i % 1000000007
return ans
N, M = list(map(int, input().split()))
MAD = 10**9+7
if abs(N-M) >= 2:
print((0))
elif N == M:
print(((2*factorial(N)*factorial(M)) % MAD))
else:
print(((factorial(N)*factorial(M)) % MAD))
| p03681 |
n, m = list(map(int,input().split()))
mod = 10**9 + 7
if abs(n-m) > 1:
print((0))
quit()
elif abs(n-m) == 1:
a = max(n,m)
b = min(n,m)
ans = 1
for i in range(1,a+1):
ans *= (i%mod)
for i in range(1,b+1):
ans *= (i%mod)
print((ans%mod))
else:
ans = 1
for i in range(1,n+1):
ans *= (i%mod)
for i in range(1,n+1):
ans *= (i%mod)
print(((2*ans)%mod)) | n, m = list(map(int,input().split()))
mod = 10**9 + 7
if abs(n-m) > 1:
print((0))
quit()
elif abs(n-m) == 1:
a = max(n,m)
b = min(n,m)
ans = 1
for i in range(1,a+1):
ans *= (i%mod)
ans %= mod
for i in range(1,b+1):
ans *= (i%mod)
ans %= mod
print((ans%mod))
else:
ans = 1
for i in range(1,n+1):
ans *= (i%mod)
ans %= mod
for i in range(1,n+1):
ans *= (i%mod)
ans %= mod
print(((2*ans)%mod)) | p03681 |
n, m = list(map(int,input().split()))
mod = 10**9 + 7
if abs(n-m) > 1:
print((0))
quit()
elif abs(n-m) == 1:
a = max(n,m)
b = min(n,m)
ans = 1
for i in range(1,a+1):
ans *= (i%mod)
ans %= mod
for i in range(1,b+1):
ans *= (i%mod)
ans %= mod
print((ans%mod))
else:
ans = 1
for i in range(1,n+1):
ans *= (i%mod)
ans %= mod
for i in range(1,n+1):
ans *= (i%mod)
ans %= mod
print(((2*ans)%mod)) | n, m = list(map(int,input().split()))
mod = 10**9 + 7
if abs(n-m) > 1:
print((0))
quit()
elif abs(n-m) == 1:
a = max(n,m)
b = min(n,m)
ans = 1
for i in range(1,a+1):
ans *= (i%mod)
ans %= mod
for i in range(1,b+1):
ans *= (i%mod)
ans %= mod
print((ans%mod))
else:
ans = 1
for i in range(1,n+1):
ans *= i
ans %= mod
for i in range(1,n+1):
ans *= i
ans %= mod
print(((2*ans)%mod)) | p03681 |
import math
N, M = list(map(int, input().split()))
if abs(N - M) > 1:
print((0))
elif abs(N - M) == 1:
print((math.factorial(N) * math.factorial(M)))
else:
print(((math.factorial(N) ** 2 * 2) % (10 ** 9 + 7)))
| import math
N, M = list(map(int, input().split()))
if abs(N - M) > 1:
print((0))
elif abs(N - M) == 1:
print(((math.factorial(N) * math.factorial(M)) % (10 ** 9 + 7)))
else:
print(((math.factorial(N) ** 2 * 2) % (10 ** 9 + 7)))
| p03681 |
def lam(x):
ans=1
for i in range(1,x+1):
ans*=i
return ans
n,m=list(map(int,input().split()))
n,m=min(n,m),max(n,m)
mod=10**9+7
if n<m-1:
print((0))
exit()
if n+1==m:
print((lam(n)*lam(m)%mod))
else:
print((2*lam(n)**2%mod))
| def lam(x,mo):
ans=1
for i in range(1,x+1):
ans*=i
ans%=mo
return ans
n,m=list(map(int,input().split()))
n,m=min(n,m),max(n,m)
mod=10**9+7
if n<m-1:
print((0))
exit()
if n+1==m:
print((lam(n,mod)*lam(m,mod)%mod))
else:
print((2*(lam(n,mod)**2)%mod))
| p03681 |
from math import factorial
n,m = list(map(int,input().split()))
if abs(n-m) > 1:
print((0))
elif n == m:
ans = 2*factorial(n)**2
print(ans)
else:
ans = factorial(n)*factorial(m)
print(ans) | from math import factorial
n,m = list(map(int,input().split()))
if abs(n-m) > 1:
print((0))
elif n == m:
ans = 2*(factorial(n)%(10**9+7))**2%(10**9+7)
print(ans)
else:
ans = (factorial(n)%(10**9+7))*(factorial(m)%(10**9+7))%(10**9+7)
print(ans)
| p03681 |
# 差が1か0のみ隣り合わない 適当に毎回割る再帰
n, m = list(map(int, input().split()))
if abs(n - m) > 1:
print((0))
elif n == m:
ans = 1
while n > 0:
ans *= n
n -= 1
ans %= (10 ** 9 + 7)
ans = (ans * ans * 2) % (10 ** 9 + 7)
print(ans)
else:
ans = max(n, m)
t = 1
x = min(n, m)
while x > 0:
t *= x
x -= 1
t %= (10 ** 9 + 7)
ans = (ans * t * t) % (10 ** 9 + 7)
print(ans)
| n, m = list(map(int, input().split()))
MOD = 10**9 + 7
if abs(n - m) > 1:
print((0))
elif n == m:
ans = 1
for i in range(2, n + 1):
ans *= i
ans %= MOD
# xoxoxo... とoxoxox... 、どっちを先にするかで2種類
print((2 * ans * ans % MOD))
else:
ans = 1
for i in range(2, n + 1):
ans *= i
ans %= MOD
for i in range(2, m + 1):
ans *= i
ans %= MOD
print(ans)
| p03681 |
import math
n,m = list(map(int,input().split()))
if abs(n-m)>=2:
print((0))
if abs(n-m)==1:
print((math.factorial(m)*math.factorial(n)%1000000007))
if n==m:
print((math.factorial(m)*math.factorial(n)*2%1000000007)) | n,m = list(map(int,(input().split())))
mod = 10**9+7
sn,sm = 1,1
for i in range(1,n+1):
sn = sn*i%mod
for i in range(1,m+1):
sm = sm*i%mod
if abs(n-m)>=2:
print((0))
elif abs(n-m) == 1:
print((sn*sm%mod))
elif abs(n-m) == 0:
print((sn*sm*2%mod)) | p03681 |
n, m = list(map(int, input().split()))
MOD = 1000000007
ans = 1
if abs(n - m) == 1:
for i in range(1, min(n, m) + 1):
ans *= (i ** 2) % MOD
ans = (ans * max(n, m)) % MOD
elif n == m:
for i in range(1, min(n, m) + 1):
ans *= (i ** 2) % MOD
ans = (ans * 2) % MOD
else:
ans = 0
print(ans)
| from math import factorial
n, m = list(map(int, input().split()))
MOD = 1000000007
if abs(n - m) == 1:
ans = max(n, m)
elif n == m:
ans = 2
else:
ans = 0
ans *= ((factorial(min(n, m)) % MOD)) ** 2
ans %= MOD
print(ans)
| p03681 |
import math as m
N,M=list(map(int,input().split()))
if abs(N-M)>=2:
print((0))
else:
N,M=max(N,M),min(N,M)
Pm=1
for i in range(1,M+1):
Pm*=i
Pm%=10**9+7
Pn=1
for i in range(1,N+1):
Pn*=i
Pn%=10**9+7
print(((Pm*Pn*1)%(10**9+7) if M!=N else (Pm*Pn*2)%(10**9+7)))
| N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def permutation(n):
res = 1
for i in range(1, n + 1):
res = (res * i) % MOD
return res
if abs(N - M) >= 2:
print((0))
else:
if N == M:
print(((permutation(N) * permutation(M) * 2) % MOD))
else:
N, M = max(N, M), min(N, M)
print(((permutation(N) * permutation(M)) % MOD)) | p03681 |
from math import factorial as F
N, M = list(map(int, input().split()))
N, M = min(N, M), max(N, M)
mod = 10**9+7
if M-N > 1:
print((0))
elif M-N == 1:
print((F(M)*F(N) % mod))
else:
print((F(M)**2*2 % mod))
| N, M = list(map(int, input().split()))
N, M = min(N, M), max(N, M)
mod = 10**9+7
g = [1, 1]
for i in range(2, M+1):
g.append((g[-1] * i) % mod)
if M-N > 1:
print((0))
elif M-N == 1:
print((g[M]*g[N] % mod))
else:
print((g[M]**2*2 % mod))
| p03681 |
n,m = list(map(int,input().split()))
if abs(n-m) != 0 and abs(n-m) != 1 :
print((0))
else:
x = 1
for i in range(1,min(n,m)+1):
x = x * i
if abs(n-m) == 0:
print(((2 * x * x)%(10**9+7)))
else:
print(((x * x * max(n,m))%(10**9+7))) | import math
n,m = list(map(int,input().split()))
if abs(n-m) != 0 and abs(n-m) != 1 :
print((0))
else:
x = math.factorial(min(m,n))
if abs(n-m) == 0:
print(((2 * x * x)%(10**9+7)))
else:
print(((x * x * max(n,m))%(10**9+7))) | p03681 |
def kaijo(x):
v=1
for i in range(1,x+1):
v*=i
return v
n,m=list(map(int,input().split()))
mod=10**9+7
if abs(n-m)>=2:
ans=0
else:
if n==m:
s=kaijo(n)
ans=2*s*s
else:
if n>m:
s=kaijo(m)
ans=s*s*n
else:
s=kaijo(n)
ans=s*s*m
print((ans%mod))
| def kaijo(x):
v=1
for i in range(1,x+1):
v*=i
return v
n,m=list(map(int,input().split()))
mod=10**9+7
if abs(n-m)>=2:
ans=0
else:
ans=1
for i in range(1,n+1):
ans*=i
ans%=mod
for i in range(1,m+1):
ans*=i
ans%=mod
if n==m:
ans*=2
ans%=mod
print(ans)
| p03681 |
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fact = [1, 1]
for i in range(2, max(N, M) + 1):
fact.append((i * fact[i - 1]) % MOD)
if abs(N - M) >= 2:
print((0))
elif abs(N - M) == 0:
print(((fact[N] * fact[M] * 2) % MOD))
else:
print(((fact[N] * fact[M]) % MOD))
| N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fact = [0] * (max(N, M) + 1)
fact[1] = 1
for i in range(2, max(M, N) + 1):
fact[i] = fact[i - 1] * i % MOD
if abs(N - M) > 1:
print((0))
else:
ans = fact[N] * fact[M] % MOD
if N == M:
ans *= 2
ans %= MOD
print(ans)
| p03681 |
n,m=list(map(int,input().split()))
mod=10**9+7
def kaijou(x):
y=1
for i in range(1,x+1):
y*=i
return y
if abs(n-m)>=2:
print((0))
elif n==m:
print((kaijou(n)*kaijou(m)*2))
else:
print((kaijou(n)*kaijou(m))) | n,m=list(map(int,input().split()))
mod=10**9+7
def kaijou(x):
y=1
for i in range(1,x+1):
y*=i
y%=mod
return y
if abs(n-m)>=2:
print((0))
elif n==m:
print(((kaijou(n)*kaijou(m)*2)%mod))
else:
print(((kaijou(n)*kaijou(m))%mod))
| p03681 |
# https://atcoder.jp/contests/abc065/tasks/arc076_a
import itertools
from collections import Counter
from collections import defaultdict
import bisect
import math
import heapq
def main():
N, M = list(map(int, input().split()))
mod = 10**9 + 7
if abs(N - M) > 1:
print((0))
exit()
n = 1
for i in range(1, N + 1):
n *= i
m = 1
for i in range(1, M + 1):
m *= i
if N == M:
print(((n * m * 2) % mod))
else:
print(((n * m) % mod))
if __name__ == '__main__':
main()
| # https://atcoder.jp/contests/abc065/tasks/arc076_a
import itertools
from collections import Counter
from collections import defaultdict
import bisect
import math
import heapq
def main():
N, M = list(map(int, input().split()))
mod = 10**9 + 7
if abs(N - M) > 1:
print((0))
exit()
n = 1
m = 1
for i in range(1, N + 1):
n = (n * i) % mod
for i in range(1, M + 1):
m = (m * i) % mod
if N == M:
print(((n * m * 2) % mod))
else:
print(((n * m) % mod))
if __name__ == '__main__':
main()
| p03681 |
import math
mod = 10**9+7
n,m = list(map(int,input().split()))
if n!=m and abs(n-m)!=1:
print("0")
exit()
if n==m:
n=max(n,m)
m=min(n,m)
ans = math.factorial(n)*2*math.factorial(m)
print((ans%mod))
else:
ans = math.factorial(n)*math.factorial(m)
print((ans%mod))
|
n,m=list(map(int,input().split()))
if 2<=abs(n-m):
print((0))
exit()
mod=10**9+7
if abs(n-m)==1:
dog=1
cat=1
for i in range(1,n+1):
dog*=i
dog=dog%mod
for i in range(1,m+1):
cat*=i
cat=cat%mod
print((dog*cat%mod))
else:
dog=1
cat=1
for i in range(1,n+1):
dog*=i
dog=dog%mod
for i in range(1,m+1):
cat*=i
cat=cat%mod
print((dog*cat*2%mod))
| p03681 |
from math import factorial
n, m = list(map(int, input().split()))
if n == m:
print((2 * factorial(n)**2 % 1000000007))
elif abs(n - m) < 2:
print((factorial(max(n, m)) * factorial(min(n, m) % 1000000007)))
else:
print((0))
| from math import factorial
n, m = list(map(int, input().split()))
if n == m:
print((2 * factorial(n)**2 % 1000000007))
elif abs(n - m) < 2:
print((factorial(n) * factorial(m) % 1000000007))
else:
print((0))
| p03681 |
from math import factorial
n, m = list(map(int, input().split()))
if n == m:
print((2 * factorial(n)**2 % 1000000007))
elif abs(n - m) < 2:
print((factorial(n) * factorial(m) % 1000000007))
else:
print((0))
| n, m = sorted(map(int, input().split()))
mod = 10**9 + 7
def factorial(n):
ans = 1
for i in range(1, n + 1):
ans *= i
ans %= mod
return ans
if n == m:
ans = factorial(n)
print((ans ** 2 * 2 % mod))
elif m - n == 1:
ans = factorial(n)
print((ans ** 2 * m % mod))
else:
print((0))
| p03681 |
import math
m,n=list(map(int,input().split()))
f=abs(m-n)
if f == 0:
ans=2*math.factorial(m)*math.factorial(n)
print(ans)
exit()
elif f == 1:
ans=math.factorial(m)*math.factorial(n)
print(ans)
exit()
else:
print((0))
exit() | import math
MOD = 1000000007
m,n=list(map(int,input().split()))
f=abs(m-n)
if f == 0:
ans=2*math.factorial(m)*math.factorial(n)%MOD
print(ans)
exit()
elif f == 1:
ans=math.factorial(m)*math.factorial(n)%MOD
print(ans)
exit()
else:
print((0))
exit()
| p03681 |
import math
N,M=list(map(int,input().split()))
x=math.factorial(N)
y=math.factorial(M)
if(abs(N-M)>1):
print((0))
else:
if((N%2==0 and M%2==0) or N==M):
print((x*y*2%(10**9+7)))
else:
print((x*y)) | import math
N,M=list(map(int,input().split()))
x=math.factorial(N)*math.factorial(M)%(10**9+7)
if(abs(N-M)>1):
print((0))
else:
if((N%2==0 and M%2==0) or N==M):
print((x*2%(10**9+7)))
else:
print(x) | p03681 |
import math
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
elif abs(N-M) == 1:
print((math.factorial(N)*math.factorial(M)))
else:
print((math.factorial(N)*math.factorial(M)*2)) | import math
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
elif abs(N-M) == 1:
res = math.factorial(N)*math.factorial(M)
print((res%(10**9+7)))
else:
res = math.factorial(N)*math.factorial(M) * 2
print((res%(10**9+7))) | p03681 |
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N+1):
ans *= i
ans = ans % MOD
for i in range(2, M+1):
ans *= i
ans = ans % MOD
print(ans)
if __name__ == "__main__":
main()
| N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N+1):
ans *= i
ans = ans % MOD
for i in range(2, M+1):
ans *= i
ans = ans % MOD
print(ans)
| p03681 |
from math import factorial
def fac(n, mod):
res = 1
for i in range(1, n + 1):
res = res * i % mod
return res
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
if abs(n - m) > 1:
print((0))
else:
if n == m:
res = fac(n, mod) * fac(m, mod) * 2 % mod
else:
res = fac(n, mod) * fac(m, mod) % mod
print(res) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
if abs(n - m) >= 2:
print((0))
exit()
fact = [1]
for i in range(2, max(n, m) + 1):
fact.append((fact[-1] * i) % mod)
res = fact[n - 1] * fact[m - 1] % mod
print((res if n != m else res * 2 % mod))
if __name__ == '__main__':
resolve()
| p03681 |
import math
N,M = list(map(int, input().split()))
if abs(N-M)>=2:
print((0))
elif abs(N-M)==1:
print((math.factorial(N)*math.factorial(M)))
else:
print(((2*math.factorial(N)*math.factorial(M))%(10**9+7))) | import math
def f(n):
if n==1:
return 1
return n*f(n-1)
N,M = list(map(int, input().split()))
if abs(N-M)>=2:
print((0))
elif abs(N-M)==1:
print((math.factorial(N)*math.factorial(M)%(10**9+7)))
else:
print(((2*math.factorial(N)*math.factorial(M))%(10**9+7))) | p03681 |
import math
def fact(n):
return math.factorial(n)
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
mod = int(1e9)+7
if N == M:
print((2*fact(N)*fact(M)%mod))
else:
print((fact(N)*fact(M)%mod)) | import math
def fact(n):
mod = int(1e9)+7
return math.factorial(n)%mod
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
mod = int(1e9)+7
if N == M:
print((2*fact(N)*fact(M)%mod))
else:
print((fact(N)*fact(M)%mod)) | p03681 |
import math
def fact(n):
mod = int(1e9)+7
return math.factorial(n)%mod
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
mod = int(1e9)+7
if N == M:
print((2*fact(N)*fact(M)%mod))
else:
print((fact(N)*fact(M)%mod)) | def fact(n):
mod = int(1e9)+7
res = 1
for i in range(1,n+1):
res = (res*i)%mod
return res
N,M = list(map(int,input().split()))
if abs(N-M) >= 2:
print((0))
exit()
mod = int(1e9)+7
if N == M:
print((2*fact(N)*fact(M)%mod))
else:
print((fact(N)*fact(M)%mod)) | p03681 |
import math
n, m = list(map(int, input().split()))
div = 10**9 + 7
if abs(n-m)>1:
print((0))
exit()
elif n == m:
ans1 = math.factorial(n)
ans2 = math.factorial(m)
ans = 2 * ans1 * ans2
else:
ma = max(n,m)
mi = min(n,m)
ans1 = math.factorial(ma)
ans2 = math.factorial(mi)
ans = ans2*ans1
print((ans % div))
| import math
n, m = list(map(int, input().split()))
div = 10**9 + 7
if abs(n-m)>1:
print((0))
exit()
elif n == m:
ans1 = math.factorial(n)
ans2 = math.factorial(m)
ans = 2 * ans1 * ans2
else:
ans1 = math.factorial(n)
ans2 = math.factorial(m)
ans = ans2*ans1
print((ans % div)) | p03681 |
N, M = list(map(int, input().split()))
ans = 0
nn = 1
mm = 1
for i in range(1, N+1):
nn *= i
for i in range(1, M+1):
mm *= i
if N == M:
ans = ((2*nn*mm)%(10**9+7))
elif abs(N-M) ==1:
ans = ((nn*mm)%(10**9+7))
print(ans) | N, M = list(map(int, input().split()))
ans = 0
nn = 1
mm = 1
for i in range(1, N+1):
nn = (nn*i)%(10**9+7)
for i in range(1, M+1):
mm = (mm*i)%(10**9+7)
if N == M:
ans = ((2*nn*mm)%(10**9+7))
elif abs(N-M) ==1:
ans = ((nn*mm)%(10**9+7))
print(ans) | p03681 |
import math
n,m=list(map(int,input().split()))
a=math.factorial(n)
b=math.factorial(m)
if n==m:
print(((2*a**2)%(10**9+7)))
elif abs(n-m)==1:
print(((a*b)%(10**9+7)))
else:
print((0))
| def fact(n):
if n==1:
return 1
else:
c=1
for i in range(1,n+1):
c=(c*i)%(10**9+7)
return c
n,m=list(map(int,input().split()))
if n==m:
print(((2*(fact(n)**2))%(10**9+7)))
elif abs(n-m)==1:
print((fact(n)*fact(m)%(10**9+7)))
else:
print((0)) | p03681 |
import sys
n,m=list(map(int,input().split()))
if abs(n-m)>1:
print((0))
sys.exit()
cnt=1
for i in range(1,n+1):
cnt*=i
if n==m:
print((2*((cnt**2)%((10**9)+7))))
if n-m==1:
print(((cnt*(cnt//n))%((10**9)+7)))
if m-n==1:
print(((cnt*cnt*m)%((10**9)+7)))
| import sys
n,m=list(map(int,input().split()))
num=n
mum=m
if 2<=abs(n-m):
print((0))
sys.exit()
if abs(n-m)==1:
while n>1:
num*=n-1
n-=1
num=num%((10**9)+7)
while m>1:
mum*=m-1
m-=1
mum=mum%((10**9)+7)
print(((num*mum)%((10**9)+7)))
sys.exit()
if abs(n-m)==0:
while n>1:
num*=n-1
n-=1
num=num%((10**9)+7)
print(((2*(num**2))%((10**9)+7)))
sys.exit()
| p03681 |
n,m = list(map(int,input().split()))
mod = 10**9+7
if abs(n -m) > 1:
print((0))
if abs(n -m) == 0:
n_ans = 1
m_ans = 1
for i in range(1,n+1):
n_ans *= i%mod
for i in range(1,m+1):
m_ans *= i%mod
print((2*n_ans*m_ans%mod))
if abs(n -m) == 1:
n_ans = 1
m_ans = 1
for i in range(1,n+1):
n_ans *= i%mod
for i in range(1,m+1):
m_ans *= i%mod
print((n_ans*m_ans%mod)) | n,m = list(map(int,input().split()))
mod = 10**9+7
if abs(n -m) > 1:
print((0))
if abs(n -m) == 0:
n_ans = 1
m_ans = 1
for i in range(1,n+1):
n_ans *= i
n_ans %= mod
for i in range(1,m+1):
m_ans *= i
m_ans %= mod
print((2*n_ans*m_ans%mod))
if abs(n -m) == 1:
n_ans = 1
m_ans = 1
for i in range(1,n+1):
n_ans *= i
n_ans %= mod
for i in range(1,m+1):
m_ans *= i
m_ans %= mod
print((n_ans*m_ans%mod)) | p03681 |
N,M=list(map(int,input().split()))
abs_NM=abs(N-M)
if abs_NM>1:
print((0))
exit()
p=10**9+7
ans=1
for i in range(1,N+1):
ans=(ans*i)%p
for i in range(1,M+1):
ans=(ans*i)%p
if abs_NM==0:
ans=(ans*2)%p
print(ans) | N,M=list(map(int,input().split()))
abs_NM=abs(N-M)
if abs_NM>1:
print((0))
exit()
p=10**9+7
min_=min(N,M)
max_=max(N,M)
ans=1
for i in range(1,min_+1):
ans=(ans*i)%p
ans=(ans*i)%p
if abs_NM==1:
ans=(ans*max_)%p
else:
ans=(ans*2)%p
print(ans) | p03681 |
# ==================== mod 10**9+7
mod=10**9+7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
n,m=list(map(int,input().split()))
if n==1 and m==1:
print((2))
elif n==2 and m==1:
print((2))
elif n==1 and m==2:
print((2))
elif n==2 and m==2:
print((8))
elif n+2<=m:
print((0))
elif n+1==m:
k=1
for i in range(1,n):
k=mul(k,i+1)
for i in range(1,m):
k=mul(k,i+1)
print(k)
elif n==m:
k=1
for i in range(1,n):
k=mul(k,i+1)
for i in range(1,m):
k=mul(k,i+1)
k=mul(k,2)
print(k)
elif n==m+1:
k=1
for i in range(1,n):
k=mul(k,i+1)
for i in range(1,m):
k=mul(k,i+1)
print(k)
elif n>=m+2:
print((0)) | n,m=list(map(int,input().split()))
if abs(n-m)>=2:
print((0))
else:
nm=1
p=10**9+7
for ni in range(1,n+1):
nm=nm*ni%p
for ni in range(1,m+1):
nm=nm*ni%p
if abs(n-m)==1:
print(nm)
else:
print(((2*nm)%p)) | p03681 |
import math
n, m = list(map(int, input().split()))
if abs(n-m)>1:
print((0))
elif n-m==1:
print((int((math.factorial(n)*math.factorial(m))%(10**9+7))))
elif m-n==1:
print((int((math.factorial(m)*math.factorial(n))%(10**9+7))))
elif n==m:
print((int((math.factorial(n)*math.factorial(m)*2)%(10**9+7)))) | from math import factorial
n,m=list(map(int,input().split()))
l=10**9+7
if abs(n-m)>1:
print((0))
exit()
if abs(n-m)==1:
print(((factorial(n)*factorial(m))%l))
else:
print((((factorial(n)**2)*2)%l)) | p03681 |
def resolve():
'''
code here
'''
import math
N, M = [int(item) for item in input().split()]
deff = N - M
if deff == 0:
temp = math.factorial(N)
res = (temp**2 * 2) % (10**9+7)
elif abs(deff) == 1:
res = (math.factorial(N) * math.factorial(M)) % (10**9+7)
else:
res = 0
print(res)
if __name__ == "__main__":
resolve()
| def resolve():
'''
code here
'''
import math
N, M = [int(item) for item in input().split()]
deff = N - M
if deff == -1:
N, M = M, N
if deff == 0:
temp = math.factorial(N)
res = (temp**2 * 2) % (10**9+7)
elif abs(deff) == 1:
res = (math.factorial(N) **2 // N ) % (10**9+7)
else:
res = 0
print(res)
if __name__ == "__main__":
resolve()
| p03681 |
nums = [1, 1]
def step_div(n):
i = len(nums)
while i <= n:
nums.append(nums[i-1] * i)
i += 1
return nums[n]
n, m = list(map(int, input().split(" ")))
remain = abs(n-m)
if remain <= 1:
print(((step_div(n) * step_div(m) * (2 if remain==0 else 1)) % (10**9+7)))
else:
print((0)) | import math
n, m = list(map(int, input().split(" ")))
remain = abs(n-m)
if remain <= 1:
print(((math.factorial(n) * math.factorial(m) * (2 if remain==0 else 1)) % (10**9+7)))
else:
print((0))
| p03681 |
N, M = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
def mod_fact(n, mod = 10 ** 9 + 7):
result = 1
for i in range(2, n + 1):
result = (result * i) % mod
return result
if N == M:
print(((2 * mod_fact(N) * mod_fact(M)) % mod))
elif abs(N - M) == 1:
print(((mod_fact(N) * mod_fact(M)) % mod))
else:
print((0))
| def mod_fact(n, mod):
ans = 1
for i in range(2, n + 1):
ans = ans * i % mod
return ans
mod = 10 ** 9 + 7
N, M = list(map(int, input().split()))
if N == M:
print((2 * mod_fact(N, mod) ** 2 % mod))
elif abs(N - M) == 1:
print((mod_fact(min(M, N), mod) ** 2 * max(M, N) % mod))
else:
print((0))
| p03681 |
mod = 10**9+7
def kaizyou(x):
y = 1
while x != 0:
y *= x
x -= 1
return y%mod
N , M = list(map(int, input().split()))
if abs(N-M) >= 2:
ans = 0
elif N == M:
ans = 2 * kaizyou(N) ** 2
elif N > M:
ans = N * kaizyou(M) ** 2
else:
ans = M * kaizyou(N) ** 2
print((ans%mod)) | mod = 10**9+7
def kaizyou(x):
y = 1
for i in range(2, x+1):
y = (y*i)%mod
return y
N , M = list(map(int, input().split()))
if abs(N-M) >= 2:
ans = 0
elif N == M:
ans = 2 * kaizyou(N) ** 2
elif N > M:
ans = N * kaizyou(M) ** 2
else:
ans = M * kaizyou(N) ** 2
print((ans%mod)) | p03681 |
import sys
sys.setrecursionlimit(1000000)
N,M = list(map(int, input().split()))
if abs(N-M) > 1:
print((0))
exit()
def frac(n):
if n == 1: return 1
return n * frac(n-1)
n_frac = frac(N)
m_frac = frac(M)
if N-M == 0:
print(((n_frac*m_frac)*2))
else:
print((n_frac*m_frac))
| from math import factorial
N,M = list(map(int, input().split()))
mod = 10 ** 9 + 7
if abs(N-M) > 1:
print((0))
exit()
n_frac = factorial(N)
m_frac = n_frac
if N-M == 0:
print(((n_frac*m_frac)*2%mod))
else:
if N > M:
m_frac //= N
else:
m_frac *= M
print((n_frac*m_frac%mod)) | p03681 |
from math import factorial
MOD = 10**9 + 7
n, m = list(map(int, input().split()))
if n == m:
print((2 * factorial(n)**2 % MOD))
elif n - 1 == m:
print((n * factorial(m)**2 % MOD))
elif n == m - 1:
print((m * factorial(n)**2 % MOD))
else:
print((0)) | def factorial(n):
ans = 1
for i in range(2, n + 1):
ans = ans * i % 1000000007
return ans
n, m = list(map(int, input().split()))
MOD = 10**9 + 7
if n == m:
print((2 * factorial(n) ** 2 % MOD))
elif abs(n - m) == 1:
print((factorial(min(m, n)) ** 2 * max(m, n) % MOD))
else:
print((0)) | p03681 |
import math
N, M = list(map(int, input().split()))
N, M = max(N,M), min(N,M)
if N == M:
ans = math.factorial(N) ** 2 * 2
elif N - M == 1:
ans = math.factorial(N) * math.factorial(M)
else:
ans = 0
print(ans)
| import math
N, M = list(map(int, input().split()))
N, M = max(N,M), min(N,M)
MOD = 10**9+7
if N == M:
ans = math.factorial(N) ** 2 * 2
elif N - M == 1:
ans = math.factorial(M) ** 2 * N
else:
ans = 0
print((ans % MOD))
| p03681 |
import math
n, m = list(map(int,input().split()))
mod = (10**9)+7
N = math.factorial(n)
M = math.factorial(m)
mul = 0 if abs(n-m)>1 else 2 if n==m else 1
print((N*M*mul%mod)) | import math
n, m = list(map(int,input().split()))
mod = (10**9)+7
mul = 0 if abs(n-m)>1 else 2 if n==m else 1
a = min(n,m)
A = math.factorial(a)
B = A
if mul==1:
B*=max(n,m)
print((A*B*mul%mod)) | p03681 |
n,m = list(map(int,input().split()))
diff = abs(n-m)
count1 = 1
count2 = 1
a = 1
def saiki(n):
if n<=1:
return 1
return n * saiki(n-1)
if diff >= 2:
print((0))
elif diff == 1:
for i in range(1,max(n,m)+1):
count1 *= i
'''
for i in range(1,(min(n,m)+1)):
count2 *= i
'''
print((count1*(count1//max(n,m))%(10**9+7)))
else:
for i in range(1,n+1):
count1 *= i
print((count1*count1*2%(10**9+7)))
| import math
n,m = list(map(int,input().split()))
diff = abs(n-m)
count1 = 1
count2 = 1
a = 1
if diff >= 2:
print((0))
elif diff == 1:
ans = math.factorial(max(n,m))
print((ans*(ans//max(n,m))%(10**9+7)))
else:
ans = math.factorial(n)
print((ans*ans*2%(10**9+7)))
| p03681 |
N,M = list(map(int,input().split()))
if abs(M-N) > 1:
print((0))
exit()
L = 0
if N == M:
cnt = 1
for i in range(1,N+1):
cnt *= i
ccnt = cnt
else:
mi = min([N,M])
ma = max([N,M])
cnt = 1
for i in range(1,mi+1):
cnt *= i
ccnt = cnt * ma
nn = N%2
mm = M%2
if (nn == 0 and mm == 0) or (nn == 1 and mm == 1):
print(((cnt * ccnt * 2) % 1000000007))
else:
print(((cnt * ccnt) % 1000000007))
| N,M = list(map(int,input().split()))
if abs(M-N) > 1:
print((0))
exit()
L = 0
if N == M:
cnt = 1
for i in range(1,N+1):
cnt *= i
cnt %= 1000000007
ccnt = cnt
else:
mi = min([N,M])
ma = max([N,M])
cnt = 1
for i in range(1,mi+1):
cnt *= i
cnt %= 1000000007
ccnt = cnt * ma
nn = N%2
mm = M%2
if (nn == 0 and mm == 0) or (nn == 1 and mm == 1):
print(((cnt * ccnt * 2) % 1000000007))
else:
print(((cnt * ccnt) % 1000000007)) | p03681 |
p = 10**9+7
N,M = list(map(int,input().split()))
a = 1
for i in range(2,N+1):
a = (a*i)%p
b = 1
for i in range(2,M+1):
b = (b*i)%p
if M==N:
n = (2*a*b)%p
elif M==N-1 or N==M-1:
n = (a*b)%p
else:
n = 0
print(n) | p = 10**9+7
N,M = list(map(int,input().split()))
A = [1 for _ in range(N+1)]
for i in range(2,N+1):
A[i] = (i*A[i-1])%p
B = [1 for _ in range(M+1)]
for i in range(2,M+1):
B[i] = (i*B[i-1])%p
if abs(N-M)>1:
ans = 0
elif abs(N-M)==1:
ans = (A[N]*B[M])%p
elif abs(N-M)==0:
ans = (2*A[N]*B[M])%p
print(ans) | p03681 |
import math
nm = input().split(" ");
n = int(nm[0]);
m = int(nm[1]);
if n - m == 1 or m - n == 1:
ansn = math.factorial(n);
ansm = math.factorial(m);
print((ansn*ansm));
elif n == m :
ansn = math.factorial(n);
ansm = math.factorial(m);
print((ansn*ansm*2));
else :
print((0)); | nm = input().split(" ");
n = int(nm[0]);
m = int(nm[1]);
mod = 10**9+7
if n - m == 1 or m - n == 1:
ansn = 1;
for i in range(n) :
ansn = (ansn % mod)*((n-i) % mod);
ansm = 1;
for j in range(m) :
ansm = (ansm % mod)*((m-j) % mod);
print(((ansn*ansm) % mod));
elif n == m :
ansn = 1;
for i in range(n) :
ansn = (ansn % mod)*((n-i) % mod);
ansm = 1;
for j in range(m) :
ansm = (ansm % mod)*((m-j) % mod);
print(((ansn*ansm*2) % mod));
else :
print((0)); | p03681 |
def Factorial(A):
X = 1
for num in range(1, A+1):
X *= num
return X
n, m = list(map(int, input().split()))
if n == m+1:
ans = Factorial(n)*Factorial(m)
elif n == m:
ans = Factorial(n)*Factorial(m)*2
elif n+1 == m:
ans = Factorial(n)*Factorial(m)
else:
ans = 0
print(ans) | def Factorial(A):
MOD = 10**9+7
X = 1
for num in range(1, A+1):
X *= num
X %= MOD
return X
n, m = list(map(int, input().split()))
MOD = 10**9+7
if n == m+1:
ans = Factorial(n)*Factorial(m)
elif n == m:
ans = Factorial(n)*Factorial(m)*2
elif n+1 == m:
ans = Factorial(n)*Factorial(m)
else:
ans = 0
print((ans%MOD))
| p03681 |
import sys
import collections
sys.setrecursionlimit(100000)
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nl = lambda: list(nm())
nsl = lambda: list(map(str, sys.stdin.readline().split()))
n, m = nm()
memo = [-1 for i in range(max(n, m) + 1)]
mod = 10 ** 9 + 7
for i in range(1, max(n, m) + 1):
if memo[i] != -1:
continue
elif i == 1:
memo[i] = 1
else:
memo[i] = i * memo[i - 1]
if abs(n - m) >= 2:
print((0))
else:
nn = memo[n] % mod
mm = memo[m] % mod
if n == m:
print((2 * nn * mm % mod))
else:
print((nn * mm % mod))
| import sys
import collections
sys.setrecursionlimit(100000)
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nl = lambda: list(nm())
nsl = lambda: list(map(str, sys.stdin.readline().split()))
n, m = nm()
memo = [1 for _ in range(max(n, m) + 1)]
mod = 10 ** 9 + 7
for i in range(1, max(n, m) + 1):
memo[i] = memo[i - 1] * i % mod
if abs(n - m) >= 2:
print((0))
else:
nn = memo[n] % mod
mm = memo[m] % mod
if n == m:
print((2 * nn * mm % mod))
else:
print((nn * mm % mod))
| p03681 |
N,M=list(map(int,input().split()))
total=1
mod=1000000007
if N==M:
for i in range(1,N+1):
total=total*i*i
print(((total*2)%mod))
elif N+1==M or M+1==N:
total*=max(M,N)
for i in range(1,min(M,N)+1):
total=total*i*i
print((total%mod))
else:
print((0)) | N,M=list(map(int,input().split()))
total=1
mod=1000000007
if N==M:
for i in range(1,N+1):
total=total*i*i
total=total%mod
print(((total*2)%mod))
elif N+1==M or M+1==N:
total*=max(M,N)
for i in range(1,min(M,N)+1):
total=total*i*i
total=total%mod
print((total%mod))
else:
print((0)) | p03681 |
# -*- coding: utf-8 -*-
import math
n,m = list(map(int, input().split()))
mod = 10**9+7
if(n==m):
print(((2*(math.factorial(n))**2)%mod))
elif(abs(n-m)==1):
tmp = math.factorial(min(n,m))
print((max(n,m)*(tmp**2)%mod))
else:
print((0)) | # -*- coding: utf-8 -*-
def fact(x):
f = 1
for i in range(1,x+1):
f *= i
f %= 10**9+7
return f
n,m = list(map(int, input().split()))
mod = 10**9+7
if(n==m):
print(((2*(fact(n))**2)%mod))
elif(abs(n-m)==1):
tmp = fact(min(n,m))
print((max(n,m)*(tmp**2)%mod))
else:
print((0)) | p03681 |
import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
n,m = list(map(int,input().split()))
if n == m:
ans = P(n,n) * P(m,m) * 2
print(ans)
elif abs(n-m) > 1:
print((0))
else:
ans = P(n,n)*P(m,m)
print(ans) | import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
n,m = list(map(int,input().split()))
mod = 10**9+7
if n == m:
ans = P(n,n) * P(m,m) * 2
print((ans%mod))
elif abs(n-m) > 1:
print((0))
else:
ans = P(n,n)*P(m,m)
print((ans%mod)) | p03681 |
from math import factorial as f
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
if abs(n - m) == 1:
res = f(n) * f(m)
print((res % mod))
elif n == m:
res = f(n) * f(m) * 2
print((res % mod))
else:
print((0))
| n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
def permitation(x):
res = 1
for i in range(1, x + 1):
res = res * i % mod
return res
pn = permitation(n)
pm = permitation(m)
if n == m:
res = pn * pm * 2 % mod
print(res)
elif n == m - 1 or n == m + 1:
res = pn * pm % mod
print(res)
else:
print((0))
| p03681 |
n,m=list(map(int,input().split()))
mod=10**9+7
if abs(n-m)>1:
print((0))
exit()
a,b=[1,1]
for i in range(1,min(n,m)+1):
a*=i%mod
if n!=m:
b*=max(n,m)*a
print(((a*b)%mod))
else:
b=a
print(((2*a*b)%mod)) | n,m=list(map(int,input().split()))
mod=10**9+7
if abs(n-m)>1:
print((0))
exit()
a,b=[1,1]
for i in range(1,min(n,m)+1):
a=(a*i)%mod
if n!=m:
b*=max(n,m)*a
print(((a*b)%mod))
else:
b=a
print(((2*a*b)%mod)) | p03681 |
from itertools import permutations
from sys import exit, stdin
N, M = [int(_) for _ in stdin.readline().rstrip().split()]
p_n = len(list(permutations(i for i in range(N))))
p_m = len(list(permutations(i for i in range(M))))
if abs(N-M)==0:
print((2*p_n*p_m))
elif abs(N-M)==1:
print((p_n*p_m))
else:
print((0)) | from math import factorial
from sys import exit, stdin
N, M = [int(_) for _ in stdin.readline().rstrip().split()]
p_n = factorial(N)
p_m = factorial(M)
NUM = 10**9+7
if abs(N-M)==0:
ans = 2*p_n*p_m
elif abs(N-M)==1:
ans = p_n*p_m
else:
ans = 0
print((ans%NUM)) | p03681 |
# /usr/bin/python
# -*- coding: utf-8 -*-
import math
D = 10**9+7
def main():
NM = sorted(list(map(int, input().split())))
if NM[1]-NM[0] > 1:
return 0
elif NM[0]==NM[1]:
ret = 2*(math.factorial(NM[0])**2) % D
return ret
else:
ret = math.factorial(NM[0])*math.factorial(NM[1])
return ret
if __name__ == "__main__":
print((main())) | # /usr/bin/python
# -*- coding: utf-8 -*-
import math
D = 10**9+7
def main():
NM = sorted(list(map(int, input().split())))
if NM[1]-NM[0] > 1:
return 0
elif NM[0]==NM[1]:
ret = 2*(math.factorial(NM[0])**2) % D
return ret
else:
ret = math.factorial(NM[0])*math.factorial(NM[1]) % D
return ret
if __name__ == "__main__":
print((main())) | p03681 |
# /usr/bin/python
# -*- coding: utf-8 -*-
import math
D = 10**9+7
def main():
NM = sorted(list(map(int, input().split())))
if NM[1]-NM[0] > 1:
return 0
elif NM[0]==NM[1]:
ret = 2*(math.factorial(NM[0])**2) % D
return ret
else:
ret = math.factorial(NM[0])*math.factorial(NM[1]) % D
return ret
if __name__ == "__main__":
print((main())) | # /usr/bin/python
# -*- coding: utf-8 -*-
import math
D = 10**9+7
def fact(n):
ret = 1
for i in range(1,n+1):
ret = (ret*i) % D
return ret
def main():
NM = sorted(list(map(int, input().split())))
n,m = [fact(NM[0]), fact(NM[1])]
if NM[0]==NM[1]:
return (n*m*2) % D
elif NM[0]+1==NM[1]:
return (n*m) % D
else:
return 0
if __name__ == "__main__":
print((main())) | p03681 |
import math
n = sorted(list(map(int,input().split())))
if n[1] - n[0] >= 2:
ans = 0
elif n[1] - n[0] == 0:
ans = math.factorial(n[1]) **2 * 2
else:
ans = math.factorial(n[1]) * math.factorial(n[0])
print((ans % (10**9 + 7) ))
| import math
n = sorted(list(map(int,input().split())))
if n[1] - n[0] >= 2:
ans = 0
elif n[1] - n[0] == 0:
ans = math.factorial(n[1]) **2 * 2
else:
ans = n[1] * math.factorial(n[0])**2
print((ans % (10**9 + 7) )) | p03681 |
import math
n = sorted(list(map(int,input().split())))
n[1] %= (10**9 + 7)
n[0] %= (10**9 + 7)
if n[1] - n[0] >= 2:
ans = 0
elif n[1] - n[0] == 0:
ans = math.factorial(n[1]) **2 * 2
else:
ans = n[1] * math.factorial(n[0])**2
print((ans % (10**9 + 7) )) | import math
n = sorted(list(map(int,input().split())))
n[1] %= (10**9 + 7)
n[0] %= (10**9 + 7)
if n[1] - n[0] >= 2:
ans = 0
elif n[1] - n[0] == 0:
ans = (math.factorial(n[1])%(10**9 + 7)) **2 * 2
else:
ans = n[1] * (math.factorial(n[0]) % (10**9 + 7))**2
print((ans % (10**9 + 7) )) | p03681 |
from math import factorial as f
N,M = list(map(int,input().split()))
print((max(0,2-abs(N-M))*f(N)*f(M)%(10**9+7))) | from math import *
N,M = list(map(int,input().split()))
if abs(N-M)==0:
ans = 2*factorial(N)*factorial(M)
elif abs(N-M)==1:
ans = factorial(N)*factorial(M)
else:
ans = 0
print((ans%(10**9+7))) | p03681 |
from math import factorial
n,m=list(map(int,input().split()))
if n==m:
print((2*factorial(n)*factorial(m)))
elif n==m+1 or m==n+1:
print((factorial(n)*factorial(m)))
else:
print((0))
| import sys
sys.setrecursionlimit(10**7)
n,m=list(map(int,input().split()))
def fact(n):
mod=10**9+7
if n==0:
return 1
else:
return (n*fact(n-1))%mod
mod=10**9+7
if n==m:
print((2*fact(n)*fact(m)%mod))
elif n==m+1 or m==n+1:
print((fact(n)*fact(m)%mod))
else:
print((0)) | p03681 |
N,M=list(map(int,input().split()))
if abs(N-M)>1:
print((0))
exit()
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
n = 10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
ans=(fact[N]*fact[M])%p
if N==M:
ans*=2
ans%=p
print(ans) | N,M=list(map(int, input().split()))
if abs(N-M)>1:
print((0))
exit()
p = 10 ** 9 + 7
n = 10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
if N==M:
ans=2*fact[N]*fact[M] % p
else:
big = max(N, M)
small = min(N, M)
ans = fact[N]*fact[M] % p
print(ans)
| p03681 |
n, m = list(map(int, input().split()))
INF = 10**9+7
if abs(n-m) > 1:
print((0))
else:
nf = 1
for i in range(1, n+1):
nf *= i
nf %= INF
mf = 1
for i in range(1, m+1):
mf *= i
mf %= INF
if n == m:
print((nf * mf * 2 % INF))
else:
print((nf * mf % INF)) | n, m = list(map(int, input().split()))
MOD = 10**9+7
if abs(n-m) > 1:
print((0))
else:
nf, mf = 1, 1
for i in range(1, min(n, m)+1):
nf = (nf*i) % MOD
if n != m:
mf = max(n, m) * nf
else:
mf = nf
if n == m:
print((nf * mf * 2 % MOD))
else:
print((nf * mf % MOD)) | p03681 |
import math as m
a,b=list(map(int,input().split()))
print((m.factorial(a)*m.factorial(b)*[1,2][a==b] if -2<a-b<2 else 0)) | m=1000000007
f=lambda j,k:(j%m)*(k%m)%m
a,b=sorted(map(int,input().split()))
x=1
for i in range(2,a+1):
x=f(x,i)
print((f(f(x,[x*b,x][a==b]),[1,2][a==b]) if b-a<2 else 0))
| p03681 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.