input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
N = int(eval(input()))
ans = math.factorial(N) % (10**9 + 7)
print(ans) | N = int(eval(input()))
mod = 10**9 + 7
ans = 1
for i in range(1, N + 1):
ans *= i
ans %= mod
print(ans)
| p03796 |
num = int(eval(input()))
power = 1
for i in range(1,num+1):
power *= i
print((power % (pow(10,9) + 7))) | import math
num = int(eval(input()))
power = math.factorial(num)
print((power % (pow(10,9) + 7))) | p03796 |
mod = 10**9 + 7
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = ans * i
print((ans%mod)) | mod = 10**9 + 7
n = int(eval(input()))
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 % 1000000007)) | import math
N = int(eval(input()))
power = math.factorial(N)
print((power % 1000000007)) | p03796 |
import math
print((math.factorial(int(eval(input())))%(10**9+7))) | N = int(eval(input()))
MOD = 10 ** 9 + 7
answer = 1
for i in range(1, N + 1):
answer = (answer * i) % MOD
print(answer) | p03796 |
n = int(eval(input()))
power = 1
for i in range(n):
power *= (i+1)%1000000007
print((power%(1000000007)))
| n = int(eval(input()))
power = 1
for i in range(n):
power = power * (i+1)%1000000007
power %= 1000000007
print(power) | p03796 |
n=int(eval(input()))
a=1
for num in range(1,n+1):
a *= num
print((a%(10**9+7))) | n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i % 1000000007
print(p)
| p03796 |
def myAnswer(N:int) ->int:
ans = 1
for i in range(1,N+1):
ans *=i
return ans % (10**9 + 7)
def modelAnswer():
tmp=1
def main():
N = int(eval(input()))
print((myAnswer(N)))
if __name__ == '__main__':
main()
| from math import factorial
def myAnswer(N:int) ->int:
ans =factorial(N)
return ans % (10**9 + 7)
def modelAnswer():
tmp=1
def main():
N = int(eval(input()))
print((myAnswer(N)))
if __name__ == '__main__':
main() | p03796 |
from math import factorial
def myAnswer(N:int) ->int:
ans =factorial(N)
return ans % (10**9 + 7)
def modelAnswer():
tmp=1
def main():
N = int(eval(input()))
print((myAnswer(N)))
if __name__ == '__main__':
main() | def modelAnswer(N:int) -> int:
ans = 1
for i in range(1,N+1):
ans = (ans*i) % (10**9 + 7)
return ans
def main():
N = int(eval(input()))
print((modelAnswer(N)))
if __name__ == '__main__':
main()
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(n):
ans *= i + 1
ans %= 10 ** 9 + 7
print(ans) | 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()))
res = 1
for i in range(1,n+1):
res*=i
print((res%(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(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 = power%(10**9+7)
print(power)
| p03796 |
N = int(eval(input()))
ans = 1
for i in range(2, N+1):
ans *= i % 1000000007
print((ans % 1000000007)) | N = int(eval(input()))
ans = 1
for i in range(2, N+1):
ans *= i % 1000000007
ans = ans % 1000000007
print((ans % 1000000007)) | 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()))
M = 10**9 + 7
s = 1
for i in range(1, N+1):
s *= i
s %= M
print(s) | N = int(eval(input()))
# N!を(10^9+7)で割った余りを求める
# N!そのものを求める必要はなく、
# x = i*x (mod 10^9+7) と更新していけばよい
M = 10**9 + 7
s = 1
for i in range(1, N+1):
s *= i
s %= M
print(s) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1,n+1):
power = power * i
print((power%(7+10**9)))
| n = int(eval(input()))
power = 1
for i in range(1,n+1):
power = power * i
power = power%(7+10**9)
print((power%(7+10**9))) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1,n+1):
power = power * i
power = power%(7+10**9)
print((power%(7+10**9))) | n = int(eval(input()))
MOD = 10**9 + 7
str = 1
for i in range(1,n+1):
str = (str * i)%MOD
print(str)
| p03796 |
time = int(eval(input()))
p = 1
for i in range(time):
p *= i + 1
mod = p % (10**9+7)
print(mod)
| import math
time = int(eval(input()))
p = math.factorial(time)
mod = p % (10**9+7)
print(mod) | p03796 |
n = int(eval(input()))
M = 10**9+7
sum = 1
for i in range(1,n+1):
sum *= i%M
print((sum%M))
| n = int(eval(input()))
d = 1
for i in range(1,n+1):
d = (d*i)%(10**9+7)
print(d) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans*=i
print((ans%(1000000007))) | n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = (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)
print((ans%(10**9+7))) | p03796 |
n = int (eval(input ()))
x = 1
for i in range (n):
x = x*(i+1)
x = x%(10**9+7)
print (x) | n = int (eval(input ()))
x = 1
for i in range (n):
x = x*(i+1)
x = x%(10**9+7)
print (x) | 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()))
import math
print((math.factorial(n) %(10**9 + 7)))
| p03796 |
N = int(eval(input()))
power = 1
for i in range(N):
power = power * (i + 1)
print((power % ((10**9) + 7))) | from math import factorial
N = int(eval(input()))
power = factorial(N)
print((power % ((10**9) + 7))) | p03796 |
#-*-coding:utf-8-*-
def main():
n = int(eval(input()))
ans =1
for i in range(1,n+1):
ans *=i
print((ans%1000000007))
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
import math
def main():
n = int(eval(input()))
ans =math.factorial(n)
print((ans%1000000007))
if __name__=="__main__":
main() | p03796 |
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
n = int(eval(input()))
mod = 10**9+7
power=1
for i in range(1,n+1):
power*=i%mod
print((power%mod))
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
n = int(eval(input()))
mod = 10**9+7
power=1
for i in range(1,n+1):
power*=i
power%=mod
print(power)
if __name__=="__main__":
main() | 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()))
x, i = 1, 1
while i <= n:
x = (x * i) % (10 ** 9 + 7)
i += 1
print(x) | 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%(10**9+7))) | p03796 |
a=int(eval(input()))
x=1
for i in range(1,a+1):
x *= i
print((x%(10**9+7)))
| X=10**9+7
def A(c,d):
return c*d%X
a=int(eval(input()))
x=1
for i in range(1,a+1):
x = A(x,i)
print(x)
| p03796 |
X=10**9+7
def A(c,d):
return c*d%X
a=int(eval(input()))
x=1
for i in range(1,a+1):
x = A(x,i)
print(x)
| X=10**9+7
a=int(eval(input()))
x=1
for i in range(1,a+1):
x = x*i%X
print(x)
| p03796 |
X=10**9+7
a=int(eval(input()))
x=1
for i in range(1,a+1):
x=x*i
print((x%X))
| S=10**9+7
a=int(eval(input()))
x=1
for i in range(1,a+1):
x = x* i % S
print(x)
| p03796 |
from functools import reduce
N = int(eval(input()))
div = pow(10, 9) + 7
print((reduce(lambda ans, n: ans * n % div, list(range(1, N + 1))))) | N = int(eval(input()))
div = 10 ** 9 + 7
ans = 1
for i in range(2, N + 1):
ans = ans * i % 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 *= i
ans = ans % (10**9+7)
print(ans) | p03796 |
import sys
from math import factorial
MOD = 10**9 + 7
def solve():
N = int(input())
ans = factorial(N) % MOD
print(ans)
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return... | 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()))
a=1
for i in range(1,n+1):
a=a*i
print((a%(10**9+7)))
| n=int(eval(input()))
import math
print((math.factorial(n)%(10**9+7))) | p03796 |
number = int(eval(input()))
result = 1
for index in range(1, number + 1):
result = result * index
dividor = 10 ** 9 + 7
print((result % dividor)) | import math
n = int(eval(input()))
result = math.factorial(n)
dividor = 10 ** 9 + 7
print((result % dividor)) | p03796 |
N = int(eval(input()))
M = 10 ** 9 + 7
res = 1
for i in range(1, N + 1):
res *= i
print((res % M)) | N = int(eval(input()))
M = 10 ** 9 + 7
res = 1
for i in range(1, N + 1):
res *= i
res = res % M
print((res % M)) | 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%=10**9+7
print(ans) | p03796 |
n=int(eval(input()))
p=1
for i in range(1,n+1):
p=p*i
print((p%(10**9+7)))
| n=int(eval(input()))
p=1
m=10**9+7
for i in range(1,n+1):
p=p*i%m
print((p%m))
| p03796 |
N = int(eval(input()))
val = 1
for i in range(1, N+1):
val *= i
print((val%(10**9 + 7))) | N = int(eval(input()))
val = 1
for i in range(1, N+1):
val *= i
if val > 10**9 + 7:
val = val%(10**9 + 7)
print(val) | p03796 |
N =int(eval(input()))
p = 1
for i in range(1,N+1):
p = p*i
print((p%(10**9+7))) | N =int(eval(input()))
p = 1
for i in range(1,N+1):
p = p*i
p = p%(10**9+7)
print((p%(10**9+7))) | p03796 |
num = int(eval(input()))
j = 1
div = pow(10,9)+7
for i in range(num):
j = (i+1)*j
print((j%div)) | import math
num = int(eval(input()))
#div = pow(10,9)+7
print((math.factorial(num)%(pow(10,9)+7))) | p03796 |
import functools
import operator
N = int(eval(input()))
prod = functools.partial(functools.reduce,operator.mul)
print((prod(list(range(1,N+1)))%(10**9+7))) | from math import factorial
N = int(eval(input()))
print((factorial(N)%(10**9+7))) | p03796 |
mod=10**9+7
n=int(eval(input()))
a=1
for i in range(1,n+1):
a*=i
print((a%mod)) | mod=10**9+7
n=int(eval(input()))
a=1
for i in range(1,n+1):
a*=i
a%=mod
print(a) | p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i
print((p%(10**9+7))) | n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i
p = p % (10**9+7)
print(p) | p03796 |
N = int(eval(input()))
MOD = 10**9+7
ans = 1
for i in range(2,N+1):
ans *= i
print((ans%MOD)) | import math
print((math.factorial(int(eval(input())))%(10**9+7))) | p03796 |
x = int(eval(input()))
val = 1
for index in range(1,x+1):
val = val*index
print((val %(10**9 + 7))) | n = int(eval(input()))
prod = 1
for i in range(1, n+1):
prod *= i
prod %= 1000000007
print(prod)
| p03796 |
n = int(eval(input()))
ans=1
for i in range(1,n+1):
ans=(ans*i)
ans=ans%1000000007
print(ans) | n=int(eval(input()))
ans=1
for i in range(1,n+1):
ans=(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))) | N = int(eval(input()))
mod = 1000000007
ans = 1
for i in range(1,N+1):
ans = (i * ans)%mod
print(ans) | p03796 |
import math
def main():
N = int(eval(input()))
power = math.factorial(N)
print((power % (10 ** 9 + 7)))
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
power = 1
for i in range(1, N + 1):
power *= i
power %= 10 ** 9 + 7
print(power)
if __name__ == "__main__":
main()
| p03796 |
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
ans = power % (10**9 + 7)
print(ans) | 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()))
i = 1
for n in range(N):
i = i*(n+1)
print((i%(10**9+7))) | N = int(eval(input()))
i = 1
for n in range(N):
i = i*(n+1)%(10**9+7)
print(i) | p03796 |
p = 1
n = int(eval(input()))
for i in range(1, n+1):
p *= i
print((p%(10**9+7))) | # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
if p >= 10**9+7:
p = p%(10**9+7)
print(p)
if __name__ == '__main__':
main() | p03796 |
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
if p >= 10**9+7:
p = p%(10**9+7)
print(p)
if __name__ == '__main__':
main() | # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
p = p%(10**9+7)
print(p)
if __name__ == '__main__':
main() | p03796 |
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p%(10**9+7)))
if __name__ == '__main__':
main() | 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()))
r = 1
for i in range(1, N+1):
r *= i
print((r%((10**9)+7)))
| import math
r = math.factorial(int(eval(input())))
print((r%((10**9)+7)))
| p03796 |
N = int(eval(input()))
power = 1
for i in range(N):
power *= (i + 1)
print((power % (10 ** 9 + 7)))
| N = int(eval(input()))
power = 1
for i in range(N):
power *= (i + 1)
power = power % (10 ** 9 + 7)
print(power)
| p03796 |
N=int(eval(input()))
p=1
for i in range(1,N+1):
p=p*i
print((p%(10**9+7)))
| N=int(eval(input()))
p=1
for i in range(1,N+1):
p=p*i
p=p%(10**9+7)
print(p)
| p03796 |
def f(n):
ans=1
if n%2==1:
a=2
b=n//2+1
c=n+2
else:
a=1
b=n//2
c=n+1
for s in range(a,b+1):
ans*=s*(c-s)
ans=ans%(10**9+7)
return ans
print((f(int(eval(input()))))) | from math import factorial;print((factorial(int(eval(input())))%(10**9+7))) | p03796 |
# Problem B - Training Camp
# input process
N = int(eval(input()))
# initialization
frac_num = 1
INF = 10**9 + 7
for i in range(1, N+1):
frac_num = frac_num * i
print((frac_num%INF))
| # Problem B - Training Camp
# input process
N = int(eval(input()))
# initialization
frac_num = 1
INF = 10**9 + 7
for i in range(1, N+1):
frac_num = (frac_num * i) % INF
print((frac_num%INF))
| p03796 |
n=int(eval(input()))
power=1
for i in range(1,n+1):
power=power*i
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((int(power))) | p03796 |
N=int(eval(input()))
power=1
for i in range(1,N+1):
power=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()))
mod = 10**9+7
ans = 1
for i in range(1,n+1):
ans *= i
print((ans%mod)) | 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=ans*i
print((ans%(10**9+7))) | n=int(eval(input()))
j=1
for i in range(1,n+1):
j=(j*i)%(10**9+7)
print(j) | p03796 |
n = int(eval(input()))
sunuke = 1
for i in range(1, n+1):
sunuke = sunuke * i
print((sunuke % 1000000007))
| n = int(eval(input()))
sunuke = 1
for i in range(1, n+1):
sunuke = sunuke * i % 1000000007
print(sunuke)
| p03796 |
def main():
n = int(eval(input()))
power = 1
for i in range(1, n + 1):
power *= i
print((power % (10 ** 9 + 7)))
if __name__ == "__main__":
main()
| import math
def main():
n = int(eval(input()))
print((math.factorial(n) % (10 ** 9 + 7)))
# power = 1
#
# for i in range(1, n + 1):
# power *= i
# print(power % (10 ** 9 + 7))
if __name__ == "__main__":
main()
| p03796 |
a=1
for i in range(1,int(eval(input()))+1):
a*=i
print((a%(10**9+7))) | import math
print((math.factorial(int(eval(input())))%(10**9+7)))
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(2, 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 % (10**9+7)))
| p03796 |
x = int(input())
y = 1
for i in range(1, x + 1):
y *= i
print(y % (10**9+7))
| x = int(input())
y = 1
for i in range(1, x + 1):
y *= i
if y > (10**9 + 7):
y %= 10 ** 9 + 7
print(y)
| p03796 |
import math
N = int(eval(input()))
num = math.factorial(N)
k, r = divmod(num, 10**9 + 7)
print(r) | N = int(eval(input()))
FACTOR = 10 ** 9 + 7
num = 1
for i in range(1, N+1):
num *= i
k, r = divmod(num, FACTOR)
num = r
print(r) | p03796 |
#-*- coding:utf-8 -*-
N=int(eval(input()))
power=1
for i in range(N):
power*=(i+1)
print((power%(10**9+7))) | #-*- coding:utf-8 -*-
N=int(eval(input()))
power=1
for i in range(N):
power*=(i+1)
power%=(10**9+7)
print(power) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
print((ans %(10**9+7))) | mod = 10**9 + 7
N = int(eval(input()))
ans = 1
for i in range(N):
ans = ans*(i+1) % mod
print(ans) | 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()))
ans = 1
for i in range(1, N + 1):
ans *= i
print((ans % (pow(10, 9) + 7))) | import math
N = int(eval(input()))
ans = math.factorial(N)
print((ans % (pow(10, 9) + 7))) | p03796 |
N = int(eval(input()))
P = 1
for i in range(N):
P = P * (i+1)
print((P % (10**9 + 7))) | import math
N = int(eval(input()))
P = math.factorial(N)
print((P % (10**9 + 7))) | p03796 |
## ABC 055B
d = 1000000007
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans = (ans*i)%d
print(ans) | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
MOD = 1000000007 # type: int
def solve(N: int):
ans = 1
for i in range(1, N+1):
ans = (ans * i) % MOD
print(ans)
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use t... | 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
if ans >= (10**9 + 7):
ans %= (10**9+7)
print(ans) | p03796 |
N = int(eval(input()))
ans = 1
for i in range(1, N+1):
ans *= i
if ans >= (10**9 + 7):
ans %= (10**9+7)
print(ans) | N = int(eval(input()))
ans = 1
for i in range(1,N+1):
ans *= i
ans %= (1000000000+7)
print(ans) | p03796 |
import sys
input = sys.stdin.readline
def main():
ans = 1
N = int(eval(input()))
for i in range(1,N+1):
ans *= i
print((ans%(10**9+7)))
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
ans = 1
N = int(eval(input()))
for i in range(1,N+1):
ans = ans*i%(10**9+7)
print(ans)
if __name__ == '__main__':
main() | 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 = i * a % (10**9+7)
print(a) | p03796 |
N = int(eval(input()))
res = 1
for i in range(N):
res *= i+1
print((res%1000000007)) | N = int(eval(input()))
res = 1
for i in range(N):
res *= i+1
res %= 1000000007
print(res) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
answer = power % (10**9 +7)
print(answer) | N = int(eval(input()))
answer = 1
for i in range(1,N+1):
answer = answer*i%(10**9+7)
print(answer) | p03796 |
N=int(eval(input()))
power=1
for i in range(N):
power=power*(i+1)
power=power%(10**9+7)
print(power)
| N=int(eval(input()))
power=1
for i in range(N):
power=power*(i+1)
power=power%(10**9+7)
print(power)
| 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()))
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))) | N = int(eval(input()))
power = 1
for i in range(N):
power *= (i+1)
power = power%(10**9 +7)
print(power) | p03796 |
n = int(eval(input()))
res = 1
for i in range(1,n+1):
res *= i
print((res%1000000007)) | n = int(eval(input()))
res = 1
for i in range(1,n+1):
res *= i
res %= (10**9+7)
else:
print(res)
| p03796 |
N = int(eval(input()))
n = 1
for i in range(1, N+1):
n = n * i
res = n%(10**9 + 7)
print(res) | N = int(eval(input()))
n = 1
for i in range(1, N+1):
n = (n * i)%(10**9+7)
print(n) | p03796 |
n=int(eval(input()))
p=1
for i in range(1,n+1):
p=p*i
print((p%(10**9+7))) | n=int(eval(input()))
p=1
for i in range(1,n+1):
p=p*i
if p%10==0:
p=p%(10**9+7)
print((p%(10**9+7)))
| p03796 |
import math
n=int(eval(input()))
print((math.factorial(n)%(10**9+7))) | N=int(eval(input()))
def fact(n):
val=1
for i in range(2,n+1):
val*=i
val%=1000000007
return val
print((fact(N))) | p03796 |
N=int(eval(input()))
power=1
for i in range(1,N+1):
power=power*i
print((power%(10**9+7)))
| def factorial(n):
fact = 1
for i in range(2, n+1):
fact = (fact * i) % (10 ** 9 + 7)
return fact
if __name__ == '__main__':
n = int(eval(input()))
print((factorial(n))) | 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()))
pow = 1
num = 10**9+7
for i in range(1,N+1):
pow = pow*i%num
print((pow%num))
| p03796 |
N=int(eval(input()))
ans=1
while N>0:
ans*=N%(10**9+7)
N=N-1
print((ans%(10**9+7))) | N=int(eval(input()))
ans=1
for i in range(1,N+1):
ans=(ans*i)%1000000007
print((ans%(10**9+7))) | 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 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): r... | mod = 10 ** 9 + 7
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans *= i
ans %= mod
print(ans)
| p03796 |
def resolve():
n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
print((ans % (10**9 + 7)))
resolve() | def resolve():
n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
ans %= (10**9 + 7)
print(ans)
resolve() | p03796 |
N = int(eval(input()))
from math import factorial
div = int(1e9 + 7)
ans = factorial(N) % div
print(ans) | n = int(eval(input()))
div = 10**9 + 7
pw = 1
for i in range(1, n+1):
pw = (pw * i) % div
print(pw) | p03796 |
N = int(eval(input()))
p = 1
for i in range(2, N+1):
p *= i
print((p % (10**9 + 7))) | N = int(eval(input()))
p = 1
for i in range(2, N+1):
p = p * i % (10**9+7)
print(p) | p03796 |
n=int(eval(input()))
mod=10**9+7
ans=1
for i in range(1,n+1):
ans*=i
ans%=mod
print(ans) | 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()))
p = 1
for i in range(N + 1):
if i == 0:
continue
p *= i
print((p % (1000000000 + 7))) | N=int(eval(input()))
p = 1
C = 10**9+7
for i in range(N + 1):
if i == 0:
continue
p *= i
p %= C
print(p) | 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
if power > (10**9+7):
power %= (10**9+7)
print(power)
| p03796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.