input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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 % ((10**9)+7))
print((p % ((10**9)+7)))
| p03796 |
n=int(eval(input()))
c=1
for i in range(1,n+1):
c=c*i
print((c%(10**9+7))) | import math
n=int(eval(input()))
c=1*math.factorial(n)
print((c%(10**9+7))) | p03796 |
n=int(eval(input()))
ans=1
mod=10**9+7
for i in range(1,n+1):
ans*=i
ans%=mod
print((ans%mod))
| n=int(eval(input()))
mod=10**9+7
cost=1
for i in range(1,n+1):
cost*=i
cost%=mod
print(cost)
| p03796 |
# Training CampTraining Camp
N = int(eval(input()))
p = 1
for i in range(1, N+1):
p = p * i
p = float(p % (10**9 + 7))
print((int(p))) | # Training CampTraining Camp
N = int(eval(input()))
p = 1
for i in range(1, N+1):
p = p * i
p = float(p % (10**9 + 7))
print((int(p))) | p03796 |
import math
import copy
import re
mod = 10**9+7
n = int(eval(input()))
neko = 1
for i in range(n):
neko *= (i+1)
print((neko%mod)) | import math
import copy
import re
mod = 10**9+7
n = int(eval(input()))
neko = math.factorial(n)
print((neko%mod)) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1, n+1):
power *= i
ans = power % 1000000007
print(ans) | 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))) | 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 = 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()))
power = 1
for i in range(1, N+1):
power *= i
print((power % (10 ** 9 + 7))) | # N = int(input())
# power = 1
# for i in range(1, N+1):
# power *= i
# print(power % (10 ** 9 + 7))
# TLEとなってしまう
# modの世界を使う
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()))
ans = 1
for x in range(1, n + 1):
ans = ans * x
print((ans % 1000000007)) | n = int(eval(input()))
ans = 1
for x in range(1, n + 1):
ans = x * ans % (10**9 + 7)
print(ans) | p03796 |
n = int(eval(input()))
f = 1
for i in range(1, n+1):
f *= i
print((f % (10**9+7)))
| import math
n = int(eval(input()))
print((math.factorial(n) % (10**9 + 7)))
| p03796 |
import math
n = int(eval(input()))
print((math.factorial(n) % (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()))
cnt = 1
for i in range(1,n+1):
cnt *=i
print((cnt%(10**9+7)))
| n = int(eval(input()))
cnt = 1
for i in range(1,n+1):
cnt = (cnt*i)%(10**9+7)
print((cnt%(10**9+7)))
| p03796 |
N = int(eval(input()))
a = pow(10, 9) + 7
power = 1
for i in range(1, N+1):
power *= i
print((power% a)) | import math
N = int(eval(input()))
a = pow(10, 9) + 7
power = math.factorial(N)
print((power% a)) | p03796 |
ans=1
for _ in range(int(eval(input()))):
ans*=_+1
ans%=int(1e9+7)
print(ans)
| mod = 1000000007
n = int(eval(input()))
ans = 1
for i in range(1, n + 1):
ans = ans * i % mod
print(ans) | p03796 |
#!/usr/bin/env python
n=int(input().strip())
power=1
for i in range(1,n+1):
power=power*i
print(power%(10**9+7)) | N = eval(input())
ans = 1
for i in range(1, N + 1):
ans = (ans * i) % (1e9 + 7)
print(int(ans)) | p03796 |
N = eval(input())
ans = 1
for i in range(1, N + 1):
ans = (ans * i) % (1e9 + 7)
print(int(ans)) | #!/usr/bin/env python
n=int(input().strip())
power=1
for i in range(1,n+1):
power=power*i%(10**9+7)
print(power) | p03796 |
N = int(eval(input()))
P =1
for i in range(1,N+1):
P*=i
print((P%1000000007))
| N = int(eval(input()))
M = 1000000007
n=[1]*(N+1)
for i in range(1,N+1):
n[i] = (n[i-1]*i)%M
print((n[N]))
| p03796 |
N = int(eval(input()))
rate=1
for i in range(1,N+1):
rate*=i
print((rate%(10**9+7)))
| from math import factorial
N = int(eval(input()))
print((factorial(N)%(10**9+7)))
| p03796 |
import functools
import operator
N = int(eval(input()))
power_list = [x+1 for x in range(N)]
result = functools.reduce(operator.mul, power_list)
print((result % (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 % (10**9+7))) | p03796 |
import math
n = int(eval(input()))
print((math.factorial(n)%(10**9+7))) | n = int(eval(input()))
ans = 1
mod = 10**9+7
for i in range(1, n+1):
ans *= i
ans %= mod
ans %= mod
print(ans)
| p03796 |
n = int(eval(input()))
pow=1
for i in range(1,n+1):
pow = pow*i
print((pow%(10**9+7))) | n = int(eval(input()))
pow=1
for i in range(1,n+1):
pow = (pow%(10**9+7)*i)%(10**9+7)
print(pow) | p03796 |
n = int(eval(input()))
pow=1
for i in range(1,n+1):
pow = (pow%(10**9+7)*i)%(10**9+7)
print(pow) | n = int(eval(input()))
pow=1
for i in range(1,n+1):
pow = pow*i%(10**9+7)
print(pow) | 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
c = 10**9+7
for i in range(1,n+1):
ans *= i
ans %= c
print(ans) | 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 |
#ABC 55, B - training camp
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p % (10**9 + 7)))
| #ABC 55, B - training camp
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()))
a = 10**9 + 7
pow = 1
for i in range(n):
pow *= i+1
print((pow % a))
| import math
n = int(eval(input()))
print((math.factorial(n)%(10**9+7)))
| p03796 |
import math
n = int(eval(input()))
print((math.factorial(n)%(10**9+7)))
| n = int(eval(input()))
mod = 10**9 + 7
pow = 1
for i in range(n):
pow = pow*(i+1)%mod
print(pow)
| 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()))
power=1
for i in range(N):
power=power*(i+1)
print((power%(10**9+7))) | N=int(eval(input()))
power=1
for i in range(N):
if power>10**9+7:
power=(power%(10**9+7))*(i+1)
else:
power=power*(i+1)
print((power%(10**9+7)))
#print(power%(10**9+7)) | p03796 |
#!/usr/bin/env python3
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
print((power % (10**9+7)))
| #!/usr/bin/env python3
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
power %= 10**9+7
print(power)
| p03796 |
n = int(input().strip())
ans = 1
for i in range(1,n+1):
ans *= i
print((ans % (10**9 +7))) | n = int(input().strip())
ans = 1
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(1, n+1):
ans *= i
ans %= 10**9 + 7
print(ans)
| 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 |
i = int(eval(input()))
p = 1
m = (10 **9)+7
for ii in range(1,i+1):
ii %= m
p *= ii
print((p % m))
| i = int(eval(input()))
p = 1
M = 10 **9+7
for ii in range(1,i+1):
ii %= M
p *= ii
p %= M
print(p)
| 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
c = 10**9+7
for i in range(n):
ans = (ans*(i+1))%c
print(ans) | p03796 |
A = int(eval(input()))
a = 1
for i in range(1,A+1):
a = a * i
print((a%(pow(10,9)+7))) | A = int(eval(input()))
b = 1
mod = 1000000007
for a in range(1,A+1):
b = b*a % mod
print(b) | p03796 |
n=int(eval(input()))
d=1
for i in range(2,n+1):
d*=i
print((int(d%int(7+1e9)))) | import math;print((math.factorial(int(eval(input())))%int(7+1e9))) | 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 |
def training(N) :
power = 1
for i in range(1, N + 1) :
power *= i
return power % (10 ** 9 + 7)
N = int(eval(input()))
print((training(N))) | def training(N) :
power = 1
for i in range(1, N + 1) :
power = (power * i) % (10 ** 9 + 7)
return power
N = int(eval(input()))
print((training(N))) | p03796 |
line = int(eval(input()))
v1 = 1
for i in range(1,line+1) :
v1 = v1 * i
print((v1%(10**9+7))) |
line = int(eval(input()))
v1 = 1
for i in range(1,line+1) :
v1 = v1 * i % (10**9+7)
print(v1) | p03796 |
_input = int(eval(input()))
power = 1
for i in range(1, _input + 1):
power *= i
power %= 1000000007
print(power) | _input = int(eval(input()))
power = 1
for i in range(1, _input + 1):
if power >= 1000000007:
power %= 1000000007
power *= i
power %= 1000000007
print(power) | p03796 |
n = int(eval(input()))
m = 10 ** 9 + 7
ans = 1
for i in range(n):
ans *= i + 1
print((ans % m))
| import math
n = int(eval(input()))
m = 10 ** 9 + 7
print((math.factorial(n) % m))
| 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=power%(10**9+7)
print((power%(10**9+7))) | p03796 |
N = int(eval(input()))
pow = 1
for i in range(1,N+1):
pow = pow*i
num = 10**9+7
print((pow%num)) | 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 |
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return list(map(int,sys.stdin.readline().rstrip().split()))
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS()... | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return list(map(int,sys.stdin.readline().rstrip().split()))
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS()... | p03796 |
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem B
def get_power(training_count):
power = 1
for i in range(1, training_count + 1):
power *= i
return power % (10 ** 9 + 7)
if __name__ == '__main__':
training_count = int(eval(input()))
print((get_power(tra... | # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem B
if __name__ == '__main__':
from math import factorial
training_count = int(eval(input()))
print((factorial(training_count) % (10 ** 9 + 7)))
| p03796 |
def main():
N = int(eval(input()))
ans = 1
for i in range(N):
ans = ans * (i+1)
print((ans%(10**9+7)))
main() | def main():
N = int(eval(input()))
ans = 1
for i in range(N):
ans = (ans * (i+1)) % (10**9+7)
print(ans)
main() | 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 |
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(eval(input()))
power = math.factorial(n)
print((power % (10**9 + 7)))
| import math
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
a = p % (10**9 + 7)
print(a) | 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()))
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)%(10**9+7)
print(p) | p03796 |
from math import factorial
print((factorial(int(eval(input()))) % (10**9+7))) | ans = 1
for k in range(1, int(eval(input()))+1):
ans = ans*k % (10**9+7)
print(ans) | p03796 |
N = int(eval(input()))
tot = 1
for i in range(1, N+1):
tot *= i
print((tot % (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()))
power = 1
for i in range(1, N + 1):
power *= i
print((power % (10 **9 + 7))) | N = int(eval(input()))
power = 1
MOD = 10 ** 9 + 7
for i in range(1, N + 1):
power *= i
power %= MOD
print(power) | p03796 |
N = int(eval(input()))
power = 1
MOD = 10 ** 9 + 7
for i in range(1, N + 1):
power *= i
power %= MOD
print(power) | N = int(eval(input()))
MOD = 10 ** 9 + 7
power = 1
for i in range(1, N + 1):
power *= i
power %= MOD
print(power) | p03796 |
N = int(eval(input()))
MOD = 10 ** 9 + 7
power = 1
for i in range(1, N+1):
power *= i
power %= MOD
print(power) | n = int(eval(input()))
MOD = 10**9+7
p = 1
for i in range(1,n+1):
p = (p*i) % MOD
print(p) | p03796 |
n = int(eval(input()))
p = 1
MOD = 10**9+7
for i in range(n): p = p*(i+1)%MOD
print(p) | n = int(eval(input()))
mod = 10 ** 9 + 7
power = 1
for i in range(1,n+1):
power = (power*i)%mod
print(power) | p03796 |
def resolve():
number=1
for i in range(1,int(eval(input()))+1):
number*=i
print((number%(10**9+7)))
resolve() | import math
print((math.factorial(int(eval(input())))%(10**9+7))) | p03796 |
N = int(eval(input()))
ans = 1
for i in range(1,N+1):
ans *= i
print((ans%(pow(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()))
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()))
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 |
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 % (10**9+7)
print(power) | p03796 |
input_len = int(eval(input()))
ans = 1
for i in range(1, input_len+1):
ans *= i
ans = ans % ((10 ** 9) + 7)
print(ans) | input_len = int(eval(input()))
ans = 1
for i in range(1, input_len+1):
ans = (i * ans) % (10 ** 9 + 7)
print(ans) | p03796 |
n = int(eval(input()))
num = 1
for i in range(1,n+1):
num *= i
print((num%((10**9)+7))) | import math
n = int(eval(input()))
print((math.factorial(n)%((10**9)+7))) | p03796 |
n=int(eval(input()))
a=1
for i in range(1,n+1):
a*=i
print((a%(10**9+7))) | a=1
for i in range(1,int(eval(input()))+1):
a=(i*a)%(10**9+7)
print(a) | p03796 |
n=int(eval(input()))
p=1
for i in range(1,n+1):
p*=i
print((p%(10**9 + 7))) | import math
print((math.factorial(int(eval(input())))%(10**9 + 7))) | p03796 |
n = int(eval(input()))
INF = 10**9 + 7
ans = [0] * (10**5 + 1)
ans[0] = 1
for i in range(1,10**5 + 1):
ans[i] = ans[i-1] * i % INF
print((ans[n]))
| n = int(eval(input()))
mod = 10**9 + 7
ans = 1
for i in range(1,n+1):
ans = ans * i % mod
print(ans) | p03796 |
from math import factorial
mod = 10 ** 9 + 7
n = int(eval(input()))
ans = factorial(n)
print((ans % mod))
| mod = int(1e9+7)
n = int(eval(input()))
power = 1
for i in range(1, n+1):
power = power * i % mod
print(power) | p03796 |
mod = int(1e9+7)
n = int(eval(input()))
power = 1
for i in range(1, n+1):
power = power * i % mod
print(power) | import sys
MOD = 10 ** 9 + 7
n = int(sys.stdin.readline().rstrip())
def main():
res = 1
for i in range(1, n+1):
res *= i
res %= MOD
return res
if __name__ == '__main__':
ans = main()
print(ans) | p03796 |
N=int(eval(input()))
P=1
for i in range(1,N+1):
P=P*i
A=P%(10**9+7)
print(A) | N=int(eval(input()))
P=1
for i in range(1,N+1):
P=P*i
P=P%(10**9+7)
print(P) | p03796 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,c... | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,c... | p03796 |
n = int(eval(input()))
def func(times):
power = 1
divide_num = 10 ** 9 + 7
for i in range(times):
power *= (i + 1)
print((power % divide_num))
func(times=n)
|
n = int(eval(input()))
def func(times):
power = 1
divide_num = 10 ** 9 + 7
for i in range(times):
power *= (i + 1)
power %= divide_num
print(power)
func(times=n)
| p03796 |
N = int(eval(input()))
res = 1
temp = 1
for i in range(1, N + 1):
res = res * i
for i in range(9):
temp = temp * 10
temp = temp + 7
print((res % temp))
| 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()))
p = 1
for i in range(1,N+1):
p *= i
print((p % 1000000007)) | import math
N = int(eval(input()))
p = math.factorial(N)
print((p % 1000000007)) | p03796 |
import math
N = int(eval(input()))
p = math.factorial(N)
print((p % 1000000007)) | N = int(eval(input()))
p = 1
for i in range(1,N+1):
p *= i
p %= 1000000007
print(p)
| 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 %= 10**9+7
print(P) | p03796 |
n = int(eval(input()))
ans = 1
i = 1
while i < n+1:
ans *= i
i += 1
ans %= 10 ** 9 +7
print(ans) | N=int(eval(input()))
power=1
i=1
div_num = 10**9 + 7
for i in range(1,N+1):
power = (power*i) % div_num
print(power) | p03796 |
import math
N = int(eval(input()))
ans = math.factorial(N) % (10 ** 9 + 7)
print(ans) | n = int(eval(input()))
from functools import reduce
print((reduce(lambda x,y:x*y%1000000007,list(range(1,n+1))))) | p03796 |
N = int(eval(input()))
P = 1
for i in range(N):
P = P * (i+1)
print((P % 1000000007)) | N = int(eval(input()))
P = 1
for i in range(N):
P = (P * (i+1)) % 1000000007
print(P) | p03796 |
n=int(eval(input()))
k=0
ans=1
for i in range(n):
k = k+1
ans=ans*k
print((ans%(10**9+7))) | n=int(eval(input()))
k=0
ans=1
w=10**9+7
for i in range(n):
k = k+1
ans*=k
ans%=w
print(ans) | p03796 |
N=int(eval(input()))
a=1
for b in range(a,N+1):
a*=b
print((a%(10**9+7)))
| N=int(eval(input()))
a=1
for b in range(a,N+1):
a*=b
if a>10**9+7:
a=a%(10**9+7)
print(a)
| p03796 |
import sys
a = sys.stdin.readline()
A = int(a)
P = 1
I = 1
W = 10 ** 9 + 7
while I <= A:
P *= I
I += 1
P %= W
print(P) | import sys
a = sys.stdin.readline()
A = int(a)
P = 1
I = 1
W = 10 ** 9 + 7
while I <= A:
P *= I
I += 1
P %= W
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 = power * i % 1000000007
print(power)
| p03796 |
n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(n):
ans *= (i+1)
print((ans%mod)) | n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(n):
ans *= (i+1)
ans %= mod
print(ans) | p03796 |
INF = 10**9 + 7
n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
print((ans % INF)) | INF = 10**9 + 7
n = int(eval(input()))
ans =1
while n != 0:
ans = n*ans % INF
n -= 1
print(ans) | p03796 |
n = int(eval(input()))
t = 1
mod = 10**9 + 7
for i in range(1, n + 1):
t *= i
#t = t % mod
print((t % mod)) | n = int(eval(input()))
t = 1
mod = 10**9 + 7
for i in range(1, n + 1):
t *= i
t = t % mod
print(t) | p03796 |
n = int(eval(input()))
val = 1
for num in range(0,n):
val *= num+1
print((val % (10**9 + 7))) | import math
n = int(eval(input()))
val = math.factorial(n)
print((val % (10**9 + 7)))
| p03796 |
import math
N = int(eval(input()))
power = math.factorial(N)
print((power % 1000000007))
| n=int(eval(input()))
ans=1
for i in range(n):
ans=(ans*(i+1))%(10**9+7)
print(ans) | p03796 |
# ABC 055: B – Training Camp
from math import factorial
n = int(eval(input()))
power = 1
for i in range(1, n + 1):
power *= i
print((power % (10 ** 9 + 7))) | # ABC 055: B – Training Camp
from math import factorial
n = int(eval(input()))
print((factorial(n) % (10 ** 9 + 7))) | p03796 |
# ABC 055: B – Training Camp
from math import factorial
n = int(eval(input()))
print((factorial(n) % (10 ** 9 + 7))) | # ABC 055: B – Training Camp
from math import factorial
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(n):
p = p*(i+1)
print((p % (1000000000+7)))
| n = int(eval(input()))
p = 1
for i in range(n):
p = p*(i+1)
p = p % (1000000000+7)
print (p)
| p03796 |
p = 1
for i in range(int(eval(input()))):
p *= (i + 1)
print((p % (10**9 + 7)))
| p = 1
for i in range(int(eval(input()))):
p = ((i + 1)*p) % (10**9 + 7)
print(p)
| p03796 |
N = int(eval(input()))
n = 1000000007
p = 1
for i in range(1, N + 1):
p *= i
print((p % n))
| N = int(eval(input()))
n = 1000000007
p = 1
for i in range(1, N + 1):
p *= i
p %= n
print(p)
| p03796 |
N = int(eval(input()))
power = 1
for i in range(1, N + 1, 1):
power = i * power
print((power % (10 ** 9 + 7))) | N = int(eval(input()))
power = 1
for i in range(1, N + 1, 1):
power = (i * 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))) | n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
ans %= (10**9 + 7)
print(ans) | p03796 |
p = 1
for i in range(1,int(eval(input()))+1):
p *= i
print((p%(10**9+7))) | p = 1
for i in range(1,int(eval(input()))+1):
p *= i
p %= 10**9+7
print(p) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(n):
ans *= i + 1
print((ans % 1000000007))
| #!/usr/bin/env python3
n = int(eval(input()))
ans = 1
for i in range(n):
ans *= i + 1
ans %= 1000000007
print(ans)
| p03796 |
N = int(eval(input()))
ans = 1
t = 10**9+7
for i in range(1,N+1):
ans *= i
print((ans%t)) | N = int(eval(input()))
ans = 1
t = 10**9+7
for i in range(1,N+1):
ans = (ans*i)%t
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()))
ans = 1
for i in range(1,N+1):
ans = (ans * (i))%(10**9+7)
print(ans) | p03796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.