input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def modpow(a,n,p):
if n==0:
return 1
x=modpow(a,n//2,p)
x=(x*x)%p
if (n%2)==1:
x=(x*a)%p
return x%p
def modinv(a,p):
return modpow(a,p-2,p)
def ggcd(a,b):
if(b==0):
return a
return ggcd(b,a%b)
import math
import fractions
import collections
import... | def modpow(a,n,p):
if n==0:
return 1
x=modpow(a,n//2,p)
x=(x*x)%p
if (n%2)==1:
x=(x*a)%p
return x%p
def modinv(a,p):
return modpow(a,p-2,p)
def ggcd(a,b):
if(b==0):
return a
return ggcd(b,a%b)
import math
import fractions
import collections
import... | p02679 |
n = int(eval(input()))
ans = 1
for i in range(1, n + 1):
ans = ans * i
ans = ans % (10 ** 9 + 7)
print(ans)
| n = int(eval(input()))
ans = 1
for i in range(1, n + 1):
ans = (ans * i) % (10 ** 9 + 7)
# ans = ans % (10 ** 9 + 7)
print(ans)
| p03796 |
N=int(eval(input()))
P=1
for i in range (N):
P*=i+1
P=P%(10**9+7)
print(P) | N=int(eval(input()))
P=1
for i in range (N):
P*=i+1
P=P%(10**9+7)
print(P)
| p03796 |
N=int(eval(input()))
a = 1
while N!=0:
a = N*a
N =N-1
print((a%(10**9+7)))
| import math
N=int(eval(input()))
print((math.factorial(N)%(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(1, n+1):
ans *= i
ans %= 10**9 + 7
print(ans) | p03796 |
n = int(eval(input()))
import math
print((int(math.factorial(n))%(10**9+7))) | n = int(eval(input()))
mod = 10 **9 +7
ans = 1
for i in range(1, n+1):
ans *= i
ans = ans % mod
print(ans) | p03796 |
num = int(eval(input()))
input = 1
for i in range(1, num+1):
input *= i
print((input % (10**9 + 7))) | import math
num = int(eval(input()))
input = math.factorial(num)
print((input % (10**9 + 7))) | p03796 |
import math
N = int(eval(input()))
C = 10**9 + 7
print((math.factorial(N) % C)) | N = int(eval(input()))
C = 10**9+7
ans = 1
for i in range(1, N + 1):
ans *= i
ans %= C
print(ans) | p03796 |
n = int(eval(input()))
mod = pow(10, 9) + 7
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)
l = [i for i in range(1, n+1)]
print((prod(l)%mod)) | n = int(eval(input()))
mod = pow(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):
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()))
pow = 1
for i in range(n):
pow *= i+1
print((pow%(10**9+7))) | n = int(eval(input()))
pow = 1
for i in range(n):
pow *= i+1
pow = pow%(10**9+7)
print(pow) | p03796 |
n=int(eval(input()))
num = 1
div=int(1e9)+7
for i in range(1,n+1):
num *= i
print((num%div)) | n=int(eval(input()))
num = 1
div=int(1e9)+7
for i in range(1,n+1):
num = num*i%div
print(num) | 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()))
count=1
for i in range(1,n+1):
count*=i
count%=(10**9+7)
print(count)
| p03796 |
#ABC055.B
N = int(eval(input()))
cnt = 1
for i in range(N):
cnt = cnt*(i+1)
print((cnt%(10**9+7))) | #ABC055.B
import math
N = int(eval(input()))
ans = math.factorial(N)%(10**9+7)
print(ans) | p03796 |
N = int(eval(input()))
result = 1
TEISU = 10 **9 + 7
for i in range(N):
result *= (i + 1)
if result > TEISU:
print((result % TEISU))
else:
print(result)
| N = int(eval(input()))
result = 1
TEISU = 10 **9 + 7
for i in range(N):
result = (i + 1) * result % TEISU
print(result)
| p03796 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
N = int(readline().rstrip())
power = 1
for i in range(1, N+1):
power = power * i
answer = power % MOD
print(answer) | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
N = int(readline().rstrip())
answer = 1
for i in range(1, N+1):
answer = answer * i % MOD
answer = answer % MOD
print(answer) | p03796 |
import math
x = int(eval(input()))
print((math.factorial(x) % (10**9 + 7))) | M = 1000000007
n=int(eval(input()))
f = 1
for i in range(1, n + 1):
f = (f * i) % M
print(f) | p03796 |
n=int(eval(input()))
m=1
for i in range(1,n+1):
m*=i
print((m%1000000007))
| import math
n = int(eval(input()))
print((math.factorial(n) % (10**9+7)))
| p03796 |
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
mod=1000000007
n=int(eval(input()))
ans=1
for i in range(1,n+1):
ans*=i%mod
print((a... | import math
n=int(eval(input()))
print((math.factorial(n)%1000000007)) | 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 |
N = int(eval(input()))
power = 1
for x in range(1, N+1):
power *= x
print((power%(10**9+7))) | N = int(eval(input()))
power = 1
for x in range(1, N+1):
power = (power * x) % (10**9+7)
print(power) | 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()))
res=1
for i in range(1,N+1):
res=res*i
print((res%(10**9+7))) | N=int(eval(input()))
res=1
for i in range(1,N+1):
res=res*i
res=res%(10**9+7)
print(res) | p03796 |
N=int(eval(input()))
power=1
i=1
for i in range(1,N+1):
power*=i
ans=power%(1000000000+7)
print(ans) | import math
N=int(eval(input()))
power=math.factorial(N)
ans=power%(1000000000+7)
print(ans) | p03796 |
num = int(eval(input()))
result = 1
for i in range(1,num+1):
result = result *i
print((result % 1000000007)) | import math
print((math.factorial(int(eval(input())))%1000000007)) | p03796 |
import math
print((math.factorial(int(eval(input())))%1000000007)) | num = int(eval(input()))
result = 1
for i in range(1,num+1):
result = result *i % 1000000007
print(result) | p03796 |
N = int(input())
pw = 1
for i in range(1,N+1):
pw = pw * i
print(pw % (10**9 + 7))
| N = int(input())
v = 10**9 + 7
t = 1
mod = []
for i in range(1,N+1):
t = t * i
if (t > v):
mod.append(t % v)
t = 1 #reset
mod.append(t % v)
#print mod
s = 1
for j in range(len(mod)):
s = s * mod[j]
ans = s % v
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):
power = power * (i + 1) % (10**9 + 7)
print(power) | p03796 |
a=int(eval(input()))
b = 1
for i in range(1,a+1):
b *= i
print((b%1000000007)) | from math import factorial
print((factorial(int(eval(input())))%(10**9+7))) | p03796 |
n=int(eval(input()))
ans=1
for i in range(n):
ans*=i+1
print((int(ans%(10**9+7)))) | n=int(eval(input()))
ans=1
for i in range(n):
ans*=i+1
ans%=10**9+7
print(ans) | p03796 |
# -*- coding utf-8 -*-
import functools
import operator
n=int(eval(input()))
lst=list(range(1,n+1,1))
result = functools.reduce(operator.mul, lst)
print((result%(10**9+7)))
| # -*- coding utf-8 -*-
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()))
x=1
for i in range(1,n+1,1):
x=x*i
print((x%(10**9+7)))
| # -*- coding utf-8 -*-
n=int(eval(input()))
x=1
for i in range(1,n+1,1):
x=(x*i)%(10**9+7)
print(x)
| p03796 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
import math
n=int(eval(input()))
print((math.factorial(n)%(10**9+7)))
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
answer=1
n=int(eval(input()))
for i in range(1,n+1):
answer*=i
answer%=10**9+7
print(answer)
resolve() | p03796 |
n = int(eval(input()))
p = 1
for i in range(1,n+1):
p = p*i
ap = p%1000000007
print(ap)
| n = int(eval(input()))
import math
p = math.factorial(n)
ap = p%1000000007
print(ap)
| p03796 |
p = 1
for i in range(int(eval(input()))):
p = p * (i+1)
print((p%((10**9)+7))) | p = 1
for i in range(int(eval(input()))):
p = p * (i+1)
p = p%((10**9)+7)
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
def cal(a,b):
return a*b%1000000007
for i in range(1,n+1):
p = cal(p,i)
print(p) | p03796 |
# coding: utf-8
ans = 1
for i in range(1, int(eval(input()))+1):
ans *= i
ans %= (10**9 + 7)
print(ans) | # coding: utf-8
ans = 1
n_mod = 10**9 + 7
for i in range(1, int(eval(input()))+1):
ans = (ans * i) % n_mod
print(ans)
| p03796 |
n=int(eval(input()))
mod=10**9+7
power=1
for i in range(1,n+1):
power=power*i
print((power%mod)) | n=int(eval(input()))
mod=10**9+7
power=1
for i in range(1,n+1):
power=power*i%mod
print(power) | p03796 |
n = int(eval(input()))
p = 1
wari = 10**9+7
for i in range( 1,n + 1):
p *= i
print((str(p%wari))) | n = int(eval(input()))
p = 1
wari = 10**9+7
for i in range( 1,n + 1):
p = (p*i)%wari
print((str(p%wari)))
| 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%(10**9+7))) | p03796 |
N = int(eval(input()))
ans = 1
mod = 10 ** 9 + 7
for i in range(1, N+1):
ans *= i
print((ans % mod))
| import math
N = int(eval(input()))
mod = 10 ** 9 + 7
print((math.factorial(N) % mod))
| p03796 |
n = int(eval(input()))
training = 1
for i in range(1, n + 1):
training *= i
print((training % (10 ** 9 + 7)))
| n = int(eval(input()))
training = 1
for i in range(1, n + 1):
training = i * training % (10 ** 9 + 7)
print(training)
| p03796 |
n=int(eval(input()))
x=1
for i in range(1,n+1):
x*=i
print((x%(10**9+7))) | n=int(eval(input()))
x=1
for i in range(1,n+1):
x*=i
x%=10**9+7
print(x) | p03796 |
n = int(eval(input()))
rslt = 1
while n > 0:
rslt *= n
n -= 1
print((rslt%(10**9+7))) | import math
n = int(eval(input()))
print(( math.factorial(n)%(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 %= 10**9+7
print(ans) | p03796 |
n = int(eval(input()))
p = 1
for i in range(1,n+1):
p *= i
p = p % (10**9+7)
print(p) | n = int(eval(input()))
p = 1
for i in range(1,n+1):
p *= i
p = p % (10**9+7)
print(p) | p03796 |
import math
n = int(eval(input()))
print((math.factorial(n)%(10**9+7)))
| n = int(eval(input()))
pw = 1
for i in range(n):
pw *= (i+1)
pw %= 10**9+7
print(pw) | 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()))
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 |
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%(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)))
| n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans=ans*i%(1e9+7)
print((int(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 *= i
cnt %= (10**9+7)
print(cnt) | p03796 |
n = int(eval(input()))
ans = 1
while n>1:
ans *= n
n -= 1
ans %= 10**9 + 7
print(ans) | n = int(eval(input()))
ans = 1
while n>1:
ans = ans * n % (10**9 + 7)
n -= 1
print(ans) | p03796 |
n = eval(input()) # N times
n = int(n)
power = 1
for i in range(1,n+1):
power = (power * i)
a = power % (10**9 + 7)
print(a) | n = int(eval(input()))
power = 1
for i in range(1,n+1):
power = (power * i) % (10**9 + 7)
print(power) | p03796 |
ans=1
n=int(eval(input()))
for i in range(1,n+1):
ans*=i
print((ans%(10**9+7))) | ans=1
n=int(eval(input()))
for i in range(1,n+1):
ans*=i
ans=ans%(10**9+7)
print(ans) | p03796 |
ans=1
n=int(eval(input()))
for i in range(1,n+1):
ans*=i
ans=ans%(10**9+7)
print(ans) | ans=1
n=int(eval(input()))
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 * power
amari = (10 ** 9) + 7
print((int(power % amari))) | 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()))
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 math
x = int(eval(input()))
print((math.factorial(x) % (10**9 + 7))) | n = int(eval(input()))
fact = 1
for i in range(1,n+1):
fact = fact * i % (10**9 +7)
res = fact % (10**9 + 7)
print(res) | p03796 |
n = int(eval(input()))
fact = 1
for i in range(1,n+1):
fact = fact * i % (10**9 +7)
res = fact % (10**9 + 7)
print(res) | n = int(eval(input()))
ans=1
for i in range(1,n+1):
ans=(ans*i)%1000000007
print(ans) | p03796 |
import math
print((math.factorial(int(eval(input()))) % (10**9 + 7))) | n = int(eval(input()))
mod_n = 10**9+7
ans = 1
for i in range(1, n+1):
ans = ans*i%mod_n
print(ans)
| p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i
print((p % 1000000007)) | 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()))
power = 1
#power = float(power)
for i in range(N):
power = power * (i + 1)
power = power % (1000000000+7)
print(power)
| N = int(eval(input()))
power = 1
for i in range(N):
power = (i+1) * (power % 1000000007)
print((power%1000000007))
| p03796 |
N=int(eval(input()))
num=1
for i in range(1,N+1):
num*=i
print((num%(10**9+7))) | import math
print((math.factorial(int(eval(input())))%(10**9+7))) | p03796 |
#!/usr/bin/python
import math
import sys
def main(argv):
for line in sys.stdin:
n = int(line)
print(math.factorial(n) % (10 ** 9 + 7))
if __name__ == "__main__":
main(sys.argv) | #!/usr/bin/python
import math
import sys
def main(argv):
for line in sys.stdin:
n = int(line)
answer = 737935835
if n < 50000:
answer = math.factorial(n)
elif n > 50000:
for i in range(50001, n + 1):
answer = (answer * i) % (10... | p03796 |
n = int(eval(input()))
a = 1
for i in range(1,n+1):
a = i*a
a = a%(10**9+7)
print(a) | import math
n = int(eval(input()))
a = math.factorial(n)
print((a%(10**9+7))) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1, n+1):
power = power * i
answer = power % (10 ** 9 + 7)
print(answer) | 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()))
p = 1
for i in range(1, N + 1):
p *= i
print((p % 1000000007))
| import math
N = int(eval(input()))
print((math.factorial(N) % 1000000007))
| p03796 |
n = int(eval(input()))
power = 1
for i in range(1,n+1):
power *= i
#print(power)
print((power % (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()))
t=1
for i in range(1,N+1):
t*=i
print((int(t%(10**9+7))))
| import math
N=int(eval(input()))
print((int(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 = (power*i)%(10**9+7)
print(power) | p03796 |
import math
n = int(eval(input()))
m = 10**9+7
sum = 1
for i in range(2,n+1):
sum *= (i%m)
print((sum%m)) | import math
def range_prod(lo,hi):
if lo+1 < hi:
mid = (hi+lo)//2
return range_prod(lo,mid) * range_prod(mid+1,hi)
if lo == hi:
return lo
return lo*hi
def treefactorial(n):
if n < 2:
return 1
return range_prod(1,n)
n = int(eval(input()))
m = 10**9+7
... | p03796 |
def resolve():
N = int(eval(input()))
power = 1
for i in range(1, N+1):
power *= i
print((power%(10**9+7)))
if '__main__' == __name__:
resolve() | def resolve():
N = int(eval(input()))
power = 1
for i in range(1, N+1):
power *= i
power = power%(10**9+7)
print(power)
if '__main__' == __name__:
resolve() | p03796 |
N = int(eval(input()))
pow = 1
for i in range (1,N+1):
pow *= i
print((pow%(10**9+7))) | 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()))
sump=1
for i in range(n):
sump*=i+1
print((sump%(1000000007))) | n=int(eval(input()))
sump=1
for i in range(n):
sump*=i+1
sump%=1000000007
print(sump) | p03796 |
N = int(eval(input()))
i =1
j =0
while j <N:
i=i*(j+1)
j+=1
print((i%(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(1,n+1):
ans=ans*i
print((ans%(10**9+7))) | import math
x = int(eval(input()))
i=math.factorial(x)
print((i%(10**9+7))) | p03796 |
# coding: utf-8
def main():
n = int(eval(input()))
result = 1
for i in range(2, n+1):
result *= i
print((result % 1000000007))
if __name__ == '__main__':
main() | # coding: utf-8
def main():
n = int(eval(input()))
result = 1
for i in range(2, n+1):
result *= i
result %= 1000000007
print(result)
if __name__ == '__main__':
main() | p03796 |
N = int(eval(input()))
ans = 1
for i in range(1, N+1):
ans *= i
print((ans%(10**9+7)))
| from math import factorial
N = int(eval(input()))
print((factorial(N)%(10**9+7)))
| p03796 |
N = int(eval(input()))
p = 1
for i in range(N):
p = 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()))
num = 1
for i in range (n):
num *= i+1
print((num % 1000000007)) | n = int(eval(input()))
num = 1
for i in range (n):
num = (num*(i+1)) % (10**9 + 7)
print((num % 1000000007)) | p03796 |
n = int(eval(input()))
c = 0
ans = 1
for i in range(n):
c += 1
ans *= c
print((ans%(10**9+7))) | n = int(eval(input()))
c = 0
ans = 1
for i in range(n):
c += 1
ans *= c
ans %= 10**9+7
print (ans) | p03796 |
int_n = int(eval(input()))
power = 1
for i in range(1, int_n + 1):
power = power * i
print((power % (10 ** 9 + 7)))
| int_n = int(eval(input()))
power = 1
for i in range(1, int_n + 1):
power = (power * i) % (10 ** 9 + 7)
print(power) | p03796 |
lim = 10 ** 9 + 7
n = int(eval(input()))
result = 1
for q in range(n):
result *= q + 1
print((result % lim)) | lim = 1000000007
result = 1
n = int(eval(input()))
for q in range(n):
result = result % lim
result *= q + 1
print((result % lim)) | p03796 |
n = int(eval(input()))
p = 1
i = 1
while i < n or i == n:
p = p*i
i +=1
x = 10**9
print((p%(x+7))) | import math
n = int(eval(input()))
i = 1
j = math.factorial(n)
x = 10**9
print((j%(x+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()))
n = 10**9 + 7
power = math.factorial(N)
print((power % n)) | p03796 |
p=1
n=10**9+7
for i in range(1, int(eval(input()))+1):
p=p*i
print((p%n)) | p=1
n=10**9+7
for i in range(1, int(eval(input()))+1):
p=p*i
p=p%n
print(p) | p03796 |
import math;print((math.factorial(int(eval(input())))%(10**9+7))) | n=int(eval(input()))
power=1
mod=10**9+7
for i in range(1,n+1):
power=power*i%mod
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 |
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 % (10**9 + 7))) | p03796 |
N=int(eval(input()))
power=1
for i in range(1,N+1):
power*=i
print((power%(10**9+7))) | import math
print((math.factorial(int(eval(input())))%(10**9+7))) | p03796 |
# -*- coding: utf-8 -*-
import math
N = int(eval(input()))
power = 1
for i in range(N):
power *= i + 1
print((int(power) % int(math.pow(10, 9) + 7))) | N = int(eval(input()))
C = 10**9+7
ans = 1
for i in range(1, N + 1):
ans *= i
ans %= C
print(ans) | 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 |
import math
n = int(eval(input()))
print((math.factorial(n) % (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()))
p = 1
for i in range(1,N + 1):
p *= i
print((p % (10 ** 9 + 7)))
| N = int(eval(input()))
p = 1
mod = 10 ** 9 + 7
for i in range(1,N + 1):
p = (p*i) % mod
print(p)
| p03796 |
N=int(eval(input()))
sum=1
mod=10**9+7
for i in range(1,N+1):
sum*=i
print((sum%mod)) | N=int(eval(input()))
sum=1
mod=10**9+7
for i in range(1,N+1):
sum*=i
sum%=mod
print(sum) | 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):
power = power*(i+1)
if power >= 10**5:
power = power%(10**9+7)
print((power%(10**9+7)))
| p03796 |
def main():
N = int(eval(input()))
for i in range(1, N):
N *= i
print((N % (10 ** 9 + 7) ))
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
for i in range(1, N):
N = N * i % (10 ** 9 + 7)
print(N)
if __name__ == "__main__":
main() | p03796 |
def resolve():
import sys
input = sys.stdin.readline
import functools
import operator
n = int(input().rstrip())
result = functools.reduce(operator.mul, list(range(1, n + 1)))
print((result % 1000000007))
if __name__ == "__main__":
resolve()
| # row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()
# row = [int(input().rstrip()) for _ in range(n)]
def resolve():
import sys
input = sys.stdin.readline
import functools
import operator
n = int(input().rstrip())
ans = 1
... | p03796 |
N = int(eval(input()))
mod =10**9+7
ans = 1
for i in range(N):
ans *=(i+1)
print((ans%mod)) | import math
N = int(eval(input()))
mod =10**9+7
print((math.factorial(N)%mod)) | p03796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.