input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N=int(eval(input()))
ans=1
for i in range(1,N+1):
ans=ans*i
print((ans%(10**9+7))) | N=int(eval(input()))
ans=1
for i in range(1,N+1):
ans=ans*i
ans=ans%(10**9+7)
print(ans) | p03796 |
N = int(eval(input()))
p = 1
for i in range(N):
p *= (i+1)
tp = p%((10**9)+7)
print(tp) | ans=1
n=int(eval(input()))
for i in range(1,n+1):
ans*=i
ans=ans%(10**9+7)
print(ans) | p03796 |
n=int(eval(input()))
ans=1
for i in range(n):
ans=ans*(i+1)
ans=ans%1000000007
print(ans)
| n = int(eval(input()))
p = 1
for i in range(1,n+1):
p = p*i
p = p%(1000000007)
print(p)
| p03796 |
N = int(eval(input()))
max_num = 10 ** 9 + 7
power = 1
for i in range(1, N+1):
power *= i
print((power % max_num))
| N = int(eval(input()))
max_num = 10 ** 9 + 7
power = 1
for i in range(1, N+1):
power = (power * i) % max_num
print(power)
| p03796 |
import math
N = int(eval(input()))
power = math.factorial(N)
print((power % (10 ** 9 + 7)))
| import math
N = int(eval(input()))
power = 1
NUM = 10 ** 9 + 7
for i in range(1, N + 1) :
power *= i
if power >= NUM :
power %= NUM
print(power)
"""
power = math.factorial(N)
print(power % (10 ** 9 + 7))
"""
| p03796 |
n=int(eval(input()))
k=1
for i in range(1,n+1):
k*=i
print(( k%((10**9)+7) )) | n=int(eval(input()))
k=1
for i in range(1,n+1):
k=(k*i)%((10**9)+7)
print(k) | p03796 |
import math
print((math.factorial(int(eval(input())))%(10**9+7))) | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
ans=1
n=int(eval(input()))
for i in range(2,n+1):
ans=ans*i%MOD
print(ans)
resolve() | p03796 |
N = int(eval(input()))
ans = 1
for i in range(1,N + 1):
ans *= i
ans %= (10 ** 9 + 7)
print(ans) | N = int(eval(input()))
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
ans = (ans * i) % mod
print(ans)
| p03796 |
n = int(eval(input()))
pwr = 1
for i in range(1,n+1):
pwr *= i
print((pwr%(10**9+7))) | n = int(eval(input()))
pwr = 1
for i in range(1,n+1):
pwr *= i
if pwr>10**9+7:
pwr = pwr%(10**9+7)
print((pwr%(10**9+7))) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
print((power % 1000000007))
| N = int(eval(input()))
power = 1
for i in range(1,N+1):
power = (power * i) % 1000000007
print(power)
| p03796 |
n = int(eval(input()))
power = 1
for i in range(1,n+1):
power *= i
print((power%(10**9+7))) | import math
n = int(eval(input()))
power = math.factorial(n)
print((power%(10**9+7))) | p03796 |
import math
N = int(input().rstrip())
power = math.factorial(N)
print((power % (pow(10, 9) + 7))) | N = int(input().rstrip())
DIV = 10**9 + 7
ans = 1
for n in range(1, N+1):
ans = (ans * n) % DIV
print(ans) | p03796 |
N = int(eval(input()))
ans = 1
for i in range(1,N+1):
ans *= i
print((ans%(10**9+7))) | N = int(eval(input()))
ans = 1
for i in range(1,N+1):
ans = ans * i %(10**9+7)
print(ans)
| p03796 |
#ABC055
n = int(eval(input()))
p = 10 ** 9 + 7
x = 1
for i in range(1,n):
x *= (i + 1) % p
print((x % p)) | #ABC055
n = int(eval(input()))
p = 10 ** 9 + 7
x = 1
for i in range(1,n):
x *= (i + 1) % p
x %= p
print((x % p)) | p03796 |
n = int(eval(input()))
a=1
for i in range(n):
a = a * (i + 1)
print((a%(7+10**9))) | import math
print((math.factorial(int(eval(input())))%(7+10**9))) | p03796 |
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(eval(input()))
s = lambda: eval(input())
N = n()
p = 1
for i in range(N):
p *= i+1
print((p % 1000000007))
| nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(eval(input()))
s = lambda: eval(input())
N = n()
p = 1
for i in range(N):
p *= i+1
p %= 1000000007
print(p)
| p03796 |
n = int(eval(input()))
res = 1
for num in range(1, n+1):
res = res * num
res = res % (pow(10,9) + 7)
print(res) | n = int(eval(input()))
res = 1
for num in range(1, n+1):
res = res * num
res = res % (10**9 + 7)
print(res)
| p03796 |
N = int(eval(input()))
p = 1
for i in range(1,N+1):
p *= i
print((p%(10**9+7))) | from math import factorial
N = int(eval(input()))
print((factorial(N)%(10**9+7))) | p03796 |
s = eval(input())
n = int(s)
x = 1
for num in range(n):
x *= num + 1
answer = x % ((1000000000) + 7)
print(answer) | s = eval(input())
n = int(s)
x = 1
for num in range(n):
x *= num + 1
x = x % ((1000000000) + 7)
print(x)
| p03796 |
n=int(eval(input()))
'''
import sys
sys.setrecursionlimit(1000000)
def kaijo(n):
if n==0:
return(1)
else:
n=n%(10**9+7)
return(n*kaijo(n-1))
print(kaijo(n)%(10**9+7))
'''
ans=1
for i in range(1,n+1):
ans*=i%(10**9+7)
print((ans%(10**9+7))) | n=int(eval(input()))
'''
import sys
sys.setrecursionlimit(1000000)
def kaijo(n):
if n==0:
return(1)
else:
n=n%(10**9+7)
return(n*kaijo(n-1))
print(kaijo(n)%(10**9+7))
'''
ans=1
for i in range(1,n+1):
ans=i*(ans%(10**9+7))
print((ans%(10**9+7))) | p03796 |
N = int(eval(input()))
n = 1
for i in range(1, N + 1):
n *= i
a,b = divmod(n , 10**9 + 7)
print(b) | N = int(eval(input()))
n = 1
for i in range(1, N + 1):
n *= i
n %= (10**9 + 7)
print(n) | p03796 |
N = int(eval(input()))
count =1
for i in range(1,N+1):
count *=i
print((count%(10**9+7))) | n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(1, n+1):
ans *= i
ans %= mod
print(ans) | p03796 |
n=int(eval(input()))
ans=1
for i in range(1,n+1):
ans*=i
print((ans%(10**9+7))) | n=int(eval(input()))
ans=1
for i in range(2,n+1):
ans=(ans*i)%(10**9+7)
print(ans) | p03796 |
# ABC055
N = int(eval(input()))
power = 1
for n in range(1, N+1):
power *= n
print((power % (10**9+7)))
| N = int(eval(input()))
power = 1
for n in range(1, N+1):
power = power % (10**9+7) * n
print((power % (10**9+7)))
| p03796 |
n = int(eval(input()))
ans=1
for i in range(1,n+1):
ans*=i
print((ans%(10**9+7))) | n = int(eval(input()))
ans=1
for i in range(1,n+1):
ans*=i
ans=ans%(10**9+7)
print(ans) | p03796 |
n = int(eval(input()))
a=1
for i in range(1, n+1):
a *= i
print((a%(10**9+7))) | import math
n = int(eval(input()))
a = math.factorial(n) % (10**9 + 7)
print(a) | p03796 |
import math
n = int(eval(input()))
ans = math.factorial(n) # nの階乗を計算
if ans >= (10 ** 9)+7:
ans = ans % ((10 ** 9)+7)
print(ans)
| n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans = ans * i
ans = ans % ((10 ** 9)+7) # 途中で割り算の余りを求めても、最終結果は同じになる
print(ans) | p03796 |
n = int(eval(input()))
a = 1
for i in range(1, n + 1):
a *= i
print((a % (10 ** 9 + 7)))
| n = int(eval(input()))
a = 1
for i in range(1, n+1):
a = a * i % (10 ** 9 + 7)
print(a) | p03796 |
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
n=int(eval(input()))
a=1
for i in range(1,n+1):
a=a*i
print((a%1000000007)) | import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
n=int(eval(input()))
a=1
for i in range(1,n+1):
a=a*i%1000000007
print(a)
| p03796 |
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
n=int(eval(input()))
a=1
for i in range(1,n+1):
a=a*i%1000000007
print(a)
| import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
n=int(eval(input()))
a=1
big=1000000007
for i in range(1,n+1):
a=a*i%big
print(a)
| p03796 |
n=int(eval(input()))
p=1
for i in range(1,n+1):
p*=i
print((p%(10**9+7))) | n=int(eval(input()))
p=1
for i in range(1,n+1):
p*=i
p=p%(10**9+7)
print(p) | p03796 |
n = int(eval(input()))
tmp = 1
ans = 0
for i in range(1,n+1):
tmp = tmp*i
print((tmp%(1000000000 + 7))) | import math
n = int(eval(input()))
print((math.factorial(n)%1000000007)) | p03796 |
N = int(eval(input()))
p = 1
for i in range(N):
i += 1
p *= i
print((p % (10**9 + 7))) | N = int(eval(input()))
p = 1
for i in range(N):
i += 1
p *= i
p %= 10**9 + 7
print(p)
| p03796 |
#
# abc055 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
ou... | #
# abc055 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
ou... | p03796 |
n = int(eval(input()))
def main(n):
pre = 1
for i in range(1, n):
pre = pre * i
return pre * n % (pow(10, 9) + 7)
ans = main(n)
print(ans)
| n = int(eval(input()))
mod_num = pow(10, 9) + 7
def main(n):
pre = 1
for i in range(2, n + 1):
pre = pre * i % mod_num
return pre
ans = main(n)
print(ans)
| p03796 |
n = int(eval(input()))
mod_num = pow(10, 9) + 7
def main(n):
pre = 1
for i in range(2, n + 1):
pre = pre * i % mod_num
return pre
ans = main(n)
print(ans)
| n = int(eval(input()))
mod_num = pow(10, 9) + 7
def main(n):
ret = 1
for i in range(1, n + 1):
ret = ret * i % mod_num
return ret
answer = main(n)
print(answer)
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
print((ans%(10**9+7))) | n = int(eval(input()))
ans = 1
dummy1,dummy2 = divmod(n,2)
for i in range(1,dummy1+1):
ans *= i
ans *= n+1-i
ans = ans % (10**9+7)
if dummy2 == 1:
ans = ((dummy1+1)*ans % (10**9+7))
print(ans)
| p03796 |
N = -1
def _input():
global N
N = int(eval(input()))
def solve():
_input()
snuke_power = 1
for i in range(1, N+1):
snuke_power *= i
print((snuke_power % (10 ** 9 + 7)))
if __name__ == '__main__':
solve() | N = -1
def _input():
global N
N = int(eval(input()))
def solve():
_input()
snuke_power = 1
for i in range(1, N+1):
snuke_power *= i
snuke_power %= (10 ** 9 + 7)
print(snuke_power)
if __name__ == '__main__':
solve() | p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p%(10**9+7))) | n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p*i%(10**9+7)
print(p) | p03796 |
import math
N = int(eval(input()))
ans = 0
ans =math.factorial(N) % (10**9 +7)
print(ans) | N = int(eval(input()))
power = 1
for i in range(N):
power = ((i+1) * power) % 1000000007
print(power) | p03796 |
import math
N = int(eval(input()))
print((math.factorial(N)%(10**9+7))) | import math
N = int(eval(input()))
a = 1
for n in range(2,N+1):
a = a*n % (10**9+7)
print(a) | p03796 |
N = int(eval(input()))
a = 1
for n in range(2,N+1):
a = a*n % (10**9+7)
print(a) | def factorial(N):
a = 1
for n in range(2,N+1):
a = a*n % (10**9 + 7)
return a
if __name__ == '__main__':
N = int(eval(input()))
print((factorial(N))) | p03796 |
N = int(eval(input()))
power_r = 1
for n in range(2,N+1):
power_r *= n
power_r %= 10**9+7
print(power_r) | def factorial(N):
power_r = 1
for n in range(2,N+1):
power_r *= n
power_r %= 10**9+7
return power_r
if __name__ == '__main__':
N = int(eval(input()))
print((factorial(N))) | p03796 |
def factorial(N):
power_r = 1
for n in range(2,N+1):
power_r *= n
power_r %= 10**9+7
return power_r
if __name__ == '__main__':
N = int(eval(input()))
print((factorial(N))) | def factorial(N):
power_r = 1
for n in range(2,N+1):
power_r = power_r*n % (10**9+7)
return power_r
if __name__ == '__main__':
N = int(eval(input()))
print((factorial(N))) | p03796 |
#055 B
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)
N = int(eval(input()))
lists = []
for i in range(1,N+1):
lists.append(i)
ans = prod(lists)
print((ans%((10**9)+7))) | #055 B
N=int(eval(input()))
ans = 1
w = (10**9) +7
for i in range(1,N+1):
ans *=i
if ans >=w:
ans %= w
print(ans) | p03796 |
h1 = int(eval(input()))
m = 1
for i in range(h1):
m = m * (i + 1)
print((m % (10 ** 9 + 7)))
| h1 = int(eval(input()))
m = 1
for i in range(h1):
m = (m * (i + 1)) % (10 ** 9 + 7)
print(m)
| p03796 |
N = int(eval(input()))
def kaijo(N) :
ans = 1
for i in range(1,N+1) :
ans *=i
return ans
mod = 1000000007
A = kaijo(N)
print((A%mod)) | import math
print((math.factorial(int(eval(input())))%int(1e9+7))) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1, N + 1):
power *= i
print((power % (10 ** 9 + 7)))
| N = int(eval(input()))
power = 1
for i in range(1, N + 1):
power = (i*power)%(10**9+7)
print(power)
| p03796 |
N = int(eval(input()))
v = 1
for i in range(1, N + 1):
v *= i
print((v % (pow(10,9) + 7))) | N = int(eval(input()))
v = 1
for i in range(1, N + 1):
v *= i
v = v % (pow(10,9) + 7)
print(v) | p03796 |
N = int(eval(input()))
ans = 1
dev = 1000000007
for i in range(1, N+1):
ans*=i
print((ans % dev))
| N = int(eval(input()))
ans = 1
dev = 1000000007
for i in range(1, N+1):
ans = i * ans % dev
print(ans)
| p03796 |
# ABC 055 B
N = int(eval(input()))
p = 1
for i in range(1, N+1):
p *= i
print((p % 1000000007)) | # ABC 055 B
N = int(eval(input()))
p = 1
for i in range(1, N+1):
p = p * i % 1000000007
print(p) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1, N + 1):
power *= i
print((power % (10**9 + 7)))
| import math
N = int(eval(input()))
print((math.factorial(N) % (10 ** 9 + 7))) | p03796 |
N = int(eval(input()))
power = 1
for i in range(N):
power *= (i+1)
print((power % (10**9+7))) | import math
N = int(eval(input()))
power = math.factorial(N)
print((power % (10**9+7))) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1, n+1):
power *= i
print((power % 1000000007))
| n = int(eval(input()))
power = 1
for i in range(1, n+1):
power = (i * power) % 1000000007
print(power)
| p03796 |
n = int(eval(input()))
p = 1
for i in range(n):
p *= (i + 1)
print((p % (10**9 + 7)))
| n = int(eval(input()))
p = 1
for i in range(n):
p = p * (i + 1) % (10**9 + 7)
print(p)
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(n):
ans = ans * (i+1)
print(("{}".format(ans % (10**9+7)))) | n = int(eval(input()))
ans = 1
for i in range(n):
ans = ans * (i+1) % (10**9+7)
print(("{}".format(ans)))
| p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p%1000000007)) | n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = (p%1000000007) * (i%100000007)
print((p%1000000007)) | p03796 |
N = int(eval(input()))
double = 1
for i in range(1, N+1):
double = double*i
print((double%(10**9+7)))
| N = int(eval(input()))
double = 1
a = 10**9+7
for i in range(1, N+1):
double *= i
double %= a
print(double) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
ans = ans % (10 ** 9 + 7)
print(ans) | import math
n = int(eval(input()))
ans = math.factorial(n) % (10 ** 9 + 7)
print(ans) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1, N+1):
power *= i
amari = power % (10**9 + 7)
print(amari) | N = int(eval(input()))
power = 1
for i in range(1, N+1):
power *= i
power = power % (10**9 + 7)
print(power)
| p03796 |
N = int(eval(input()))
result = 1
for i in range(1,N+1):
result *= i
print((result%(10**9+7))) | N = int(eval(input()))
result =1
for i in range(1,N+1):
result *= i
result %= (10**9+7)
print(result) | p03796 |
N = int(eval(input()))
power = 1
BIGNUM = 10**9+7
for i in range(1,N+1):
power *= i
ans = power%BIGNUM
print(ans) | N = int(eval(input()))
power = 1
BIGNUM = 10**9+7
for i in range(1,N+1):
power *= i
power = power%BIGNUM
ans = power
print(ans) | p03796 |
n = int(eval(input()))
p = 1
for i in range(0,n):
p = p * (i+1)
print((p % (10**9 + 7))) | n = int(eval(input()))
p = 1
for i in range(1,n+1):
p = (p * i) % (10**9 + 7)
print(p) | p03796 |
def cal(n):
ans = 1
for i in range(1,n+1):
ans *= i
rm = ans%(10**9 + 7)
return rm
N = int(input().strip())
print((cal(N)))
| def cal(n):
ans = 1
for i in range(n):
ans = ((i+1) * ans) % (1000000007)
return ans
N = int(eval(input()))
print((cal(N)))
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = ans * i
print((ans%(10**9+7))) | n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = (ans * i)%(10**9+7)
print(ans) | p03796 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
power = 1
for x in range(1, N + 1):
power *= x
mod = 10 ** 9
mod += 7
answer = power % mod
print(answer)
| # -*- coding: utf-8 -*-
import math
N = int(eval(input()))
power = 1
mod = 10 ** 9
mod += 7
power = math.factorial(N)
print((power % mod))
| p03796 |
n = int(input())
N = []
for i in range(1,n+1):
N.append(i)
N2 = 1
for N1 in N:
N2 = N2 * N1
a = 10**9+7
N2 = N2%a
print(N2)
| n = int(input())
N = []
for i in range(1,n+1):
N.append(i)
N2 = 1
for N1 in N:
N2 = N2 * N1%(10**9+7)
print(N2)
| p03796 |
n = int(eval(input()))
mod = 10**9+7
ans = 1
i = 1
while i <= n:
ans *= i
i += 1
print((ans%mod)) | n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(1, n+1):
ans = (ans*i)%mod
print(ans) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1,n+1):
power *= i
print((power%(10**9+7))) | n = int(eval(input()))
power = 1
for i in range(1,n+1):
power *= i
power %= 10**9+7
print(power) | p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p%(10**9+7))) | import math
n = int(eval(input()))
print((math.factorial(n)%(10**9+7))) | p03796 |
# coding: utf-8
if __name__ == '__main__':
n = int(eval(input()))
p = 1
for i in range(n): #range(10) は [0,1,2,3,4,5,6,7,8,9] を表す
p = p * (i+1)
print((p % int(1e9 + 7)))
| # coding: utf-8
if __name__ == '__main__':
n = int(eval(input()))
p = 1
for i in range(n): #range(10) は [0,1,2,3,4,5,6,7,8,9] を表す
p *= (i+1)
p %= int(1e9 + 7)
print(p)
| p03796 |
n = int(eval(input()))
ans_tmp = 1
for i in range(1, n + 1):
ans_tmp *= i
print((ans_tmp % (10 ** 9 + 7)))
| n = int(eval(input()))
d = 10 ** 9 + 7
ans = 1
for i in range(1, n + 1):
ans = ans * i % d
print(ans)
| p03796 |
N = int(eval(input()))
power = 1
for num in range(1, N+1):
power = power*num
print((power%(10**9+7))) | N = int(eval(input()))
power = 1
for i in range(1, N+1):
power = (power*i)%(10**9+7)
print(power) | p03796 |
n = int(eval(input()))
t = 1
for i in range(1,n+1):
t *= i
print((t%((10**9)+7))) | n = int(eval(input()))
t = 1
a = 10**9 + 7
for i in range(1,n+1):
t *= i
t %= a
print(t) | p03796 |
N = int(eval(input()))
power=1
for i in range(1,N+1):
power=power*i
print((power%(pow(10,9)+7)))
| N = int(eval(input()))
x=1
for i in range(1,N+1):
x=i*x%(pow(10,9)+7)
print(x)
| p03796 |
n=int(eval(input()))
p=1
for i in range(1,n+1):
p*=i
print((p%(10**9+7))) | n=int(eval(input()))
p=1
for i in range(1,n+1):
p=(p*i)%(10**9+7)
print(p) | p03796 |
n = int(eval(input()))
a = 1
for i in range(1,n+1):
a = a*i
print((a%(10**9+7))) | import math
n = int(eval(input()))
a = math.factorial(n)
print((a%(10**9+7))) | p03796 |
m = 1
for var in range(int(input())):
m = m * (var + 1)
print((m%(1000000000+7))) | multi = 1
N = int(input())
for var in range(1,N + 1):
multi = multi * var
if multi > 1000000007:
multi = multi % 1000000007
print(multi) | p03796 |
N = int(eval(input()))
P = 1
for i in range(1, N+1):
P *= i
_, ans = divmod(P, 1000000007)
print(ans) | N = int(eval(input()))
ans = 1
for i in range(1, N+1):
_, ans = divmod(ans * i, 1000000007)
print(ans) | p03796 |
N=int(eval(input()))
ans=1
for i in range(1,N+1):
ans*=i
print((ans%(10**9+7))) | import math
N=int(eval(input()))
ans=math.factorial(N)%(10**9+7)
print(ans) | p03796 |
N=int(eval(input()))
power=1
for i in range(N):
power = (power*(i+1))%(10**9+7)
print(power) | def n_func(n,mod=10**9+7):
ans=1
for i in range(1,n+1):
ans=(ans*i)%mod
return ans
print((n_func(int(eval(input()))))) | p03796 |
n = int(eval(input()))
m = 10**9+7
ans = 1
for i in range(2,n+1):
ans*=i
print((ans%m)) | n = int(eval(input()))
m = 10**9+7
ans = 1
for i in range(2,n+1):
ans = ans*i%m
print((ans%m))
| p03796 |
def countPower():
power = 1
N = int(eval(input()))
i = 1
if 1<=N<=10**5:
while i <= N:
power = i*power
i += 1
return power % (10**9 + 7)
if __name__=="__main__":
print((countPower()))
| import math
def countPower():
power = 1
N = int(eval(input()))
if 1<=N<=10**5:
power = math.factorial(N)
return power % (10**9 + 7)
if __name__=="__main__":
print((countPower())) | p03796 |
a = int(eval(input()))
b = 1
for i in range(1, a + 1):
b = b * i % (10 ** 9 + 7)
print(b)
| a = int(eval(input()))
b = 1
for i in range(1, a + 1):
b = (b * i) % (10 ** 9 + 7)
print(b)
| p03796 |
N = int(eval(input()))
pwr = 1
for i in range(1, N+1):
pwr *= i
print((pwr % 1000000007)) | N = int(eval(input()))
pwr = 1
for i in range(1, N+1):
pwr *= i
pwr = pwr % 1000000007
print(pwr) | p03796 |
# 整数の入力
N = int(eval(input()))
# 計算1
p = 1
for num in range(1,N+1):
p = p * num
# 計算2
temp = 10**9 + 7
ans = p % temp
# 出力
print(ans) | # 整数の入力
N = int(eval(input()))
# 計算1
p = 1
temp = 10**9 + 7
for num in range(1,N+1):
p = p * num
if p > (10**9 + 7):
p = p % temp
# 計算2
ans = p % temp
# 出力
print(ans) | p03796 |
from operator import mul
from functools import reduce
print(reduce(mul,list(range(1,int(eval(input()))+1)),1)%(10**9+7)) | from operator import mul
from functools import reduce
print(reduce(lambda a,b:a*b%(10**9+7),list(range(1,int(eval(input()))+1)),1)) | p03796 |
n = int(eval(input()))
pwr = 1
for i in range(n):
pwr *= 1*(i+1)
print((pwr%(10**9+7))) | n = int(eval(input()))
pwr = 1
for i in range(n):
pwr *= 1*(i+1)
pwr = pwr%(10**9+7)
print(pwr) | p03796 |
n=int(eval(input()))
for i in range(1,n):
n=n*i
print((n%(pow(10,9)+7))) | n=int(eval(input()))
p=1
for i in range(1,n+1):
p=p%(pow(10,9)+7)*i
print((p%(pow(10,9)+7))) | p03796 |
N=int(eval(input()))
ans=1
for i in range(N):
ans=ans*(i+1)
print((ans%(10**9+7)))
| N=int(eval(input()))
ans=1
for i in range(N):
ans=ans*(i+1)%(10**9+7)
print((ans%(10**9+7)))
| p03796 |
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
def solve(N: int):
p = 1
for i in range(1,N+1):
p *= i
print((p % MOD))
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this ... | #!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
def solve(N: int):
p = 1
for i in range(1,N+1):
p = p * i % MOD
print(p)
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this... | p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
print((ans%(10**9+7)))
| n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = ans*i % (10**9+7)
print(ans)
| p03796 |
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
print((power%(1000000007))) | N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
power %= 1000000007
print(power) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
print((ans%(10**9+7))) | import math
print((math.factorial(int(eval(input())))%(10**9+7))) | p03796 |
N=int(eval(input()))
A=1
for i in range(N):
A *= (i+1)
# A = (1+N)/2 * N
# print(A)
A %=(10**9+7)
print(('%d' %(A)))
| import math
N=int(eval(input()))
A = math.factorial(N)
A %=(10**9+7)
print(A) | p03796 |
N=int(eval(input()))
Ans=1
for i in range(1,N+1):
Ans*=(i%(10**9+7))
print((Ans%(10**9+7))) | N=int(eval(input()))
Ans=1
for i in range(1,N+1):
Ans*=i
Ans%=(10**9+7)
print(Ans) | p03796 |
n = int(eval(input()))
p = 1
for i in range(n):
p *= (i + 1)
print((p % 1000000007)) | n = int(eval(input()))
mod = 1000000007
p = 1
for i in range(n):
p = p * (i + 1) % mod
print((p % mod)) | p03796 |
N = int(eval(input()))
ans = 1
for i in range(N):
ans *= (i + 1)
print((ans % (10 ** 9 + 7)))
| N = int(eval(input()))
ans = 1
for i in range(1, N + 1):
ans = (i * ans) % (10 ** 9 + 7)
print(ans)
| p03796 |
n = int(eval(input()))
j=1
for i in range(n,0,-1):
j*=i
print((j if j <= 10**5 else j%((10**9)+7))) | import math
n = int(eval(input()))
j=math.factorial(n)
print((j if j <= 10**5 else j%((10**9)+7))) | p03796 |
N=int(eval(input()))
key=1
for i in range(1,N+1):
key*=i
print((key%1000000007)) | N=int(eval(input()))
key=1
for i in range(1,N+1):
key=(key*i)%1000000007
print(key) | p03796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.