input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#55
n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
print((ans%(10**9+7))) | #55改
import math
n = int(eval(input()))
ans =math.factorial(n)
print((ans%(10**9+7)))
| p03796 |
a=int(eval(input()))
Sum=1
for i in range(1,a+1):
Sum*=i
print((Sum%(10**9+7)))
| a=int(eval(input()))
Sum=1
b=10**9+7
for i in range(1,a+1):
Sum=(Sum*i)%b
print(Sum)
| p03796 |
from math import factorial as f
n = int(eval(input()))
print((f(n) % (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()))
p = 1
for i in range(1, n+1):
p *= i
print((p%(10**9+7))) | import math
n = int(eval(input()))
power = math.factorial(n)
print((power%(10**9+7))) | p03796 |
N = int(eval(input()))
fact = 1
for integer in range(1,N+1):
fact *= integer
res = fact % 1000000007
print(res) | N = int(eval(input()))
fact = 1
for integer in range(1,N+1):
fact = fact * integer % 1000000007
print(fact) | 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
big_num = 10**9+7
for i in range(1,N+1):
p *= i
p %= big_num
print(p)
| p03796 |
#coding: UTF-8
N=int(eval(input()))
out=1
for i in range(1,N+1):
out=out*i
print((out%(10**9+7))) | #coding: UTF-8
import math
N=int(eval(input()))
out=math.factorial(N)
print((out%(10**9+7))) | p03796 |
def main():
N = int(eval(input()))
p = 1
for i in range(1, N + 1):
p *= i
ans = p % (10 ** 9 + 7)
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
p = 1
for i in range(1, N + 1):
# TLE
# p *= i
p = (p * i) % (10 ** 9 + 7)
ans = p % (10 ** 9 + 7)
print(ans)
if __name__ == '__main__':
main()
| p03796 |
n = int(eval(input()))
k = 1
for i in range(1,n+1):
k = 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 |
n = int(eval(input()))
p = 1
for i in range(1, n + 1):
p = p * i
print((p % 1000000007))
| import math
n = int(eval(input()))
print((math.factorial(n) % 1000000007))
| p03796 |
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
ans = ans % (10 ** 9 + 7)
print(ans) | p03796 |
N = int(eval(input()))
answer = 1
for i in range(N) :
answer *= (i+1)
answer = answer % (10**9+7)
print(answer)
| N = int(eval(input()))
answer = 1
for i in range(N) :
answer = (answer*(i+1))%(10**9+7)
print(answer)
| p03796 |
n=int(eval(input()))
pw=1
e=10**9+7
for i in range(1,n+1):
pw*=i
print((pw%e)) | import math
n=int(eval(input()))
pw=1
e=10**9+7
'''
for i in range(1,n+1):
pw*=i
print(i,pw)
'''
pw=math.factorial(n)
print((pw%e)) | p03796 |
N = int(eval(input()))
power = 1
A = 10**9 + 7
for i in range(1, N+1):
power = power * i
ans = power % A
print(ans) | N = int(eval(input()))
power = 1
A = 10**9 + 7
#yをxで割った時の商をa、余りをbとすると、y=ax+b
#ここにiを掛けると、y=(ax+b)i
#y=aix+bi、となるので第１項は余りが０になる
#なので、毎回割って、その余りにのみ注目すれば良い
for i in range(1, N+1):
power = power * i % A
print(power) | p03796 |
N=int(eval(input()))
a=1
for i in range(N):
a*=i+1
a%=1000000007
print(a) | N=int(eval(input()))
a=1
for i in range(N):
a*=(i+1)
a%=1000000007
print(a) | p03796 |
from math import factorial
N = int(eval(input()))
print((factorial(N) % (10**9 + 7))) | from math import factorial
N = int(eval(input()))
ans = 1
for i in range(1,N+1):
ans *= i % (10**9 + 7)
ans %= 10**9 + 7
print(ans) | p03796 |
# -*- coding: utf-8 -*-
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
bigint = 10 ** 9 + 7
for n in range(1, N+1):
power = power * n % bigint
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()))
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 *= i
p = p % (10**9+7)
print(p)
| p03796 |
n = int(eval(input()))
ans = 1
for i in range(1,n+1):
ans=(ans*i)%1000000007
print(ans) | p = 1
n = int(eval(input()))
for i in range(1,n+1):
p = (p*i)%(10**9+7)
print(p) | p03796 |
n,a = int(eval(input())),1
for i in range(n):
a *= i+1
print((a%(10**9+7))) | n,a = int(eval(input())),1
for i in range(n):
a = a*(i+1)%(10**9+7)
print(a) | p03796 |
N = int(eval(input()))
p = 1
for i in range(1,N+1):
p = p*i
print((p%(10**9+7))) | import math
N = int(eval(input()))
p = math.factorial(N)
print((int(p%(10**9+7)))) | p03796 |
n = int(eval(input()))
power = 1
for i in range(1, n + 1):
power *= i
mod = 10 ** 9 + 7
ans = power % mod
print(ans)
| n = int(eval(input()))
from math import factorial
power = factorial(n)
mod = 10 ** 9 + 7
ans = power % mod
print(ans)
| p03796 |
n = int(eval(input()))
from math import factorial
power = factorial(n)
mod = 10 ** 9 + 7
ans = power % mod
print(ans)
| 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()))
ans=1
for i in range(1,N+1):
ans*=i
result=ans%(10**9+7)
print(result) | import math
N=int(eval(input()))
ans=1
ans=math.factorial(N)
result=ans%(10**9+7)
print(result)
| p03796 |
import math
a=int(eval(input()))
print((math.factorial(a)%(10**9+7)))
| n=int(eval(input()))
def a(x):
if x==1:
return 1
else:
d=1
for i in range(x+1)[1:]:
d *= i
d %= 10**9+7
return d
print((a(n))) | p03796 |
n = int(input().split()[0])
warukazu = 10 ** 9 + 7
x = 1
for i in range(1, n+1):
x = x * i
print((x % warukazu)) | n = int(input().split()[0])
warukazu = 10 ** 9 + 7
x = 1
for i in range(1, n+1):
x = (x * i) % warukazu
print((x % warukazu)) | 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()))
r=1
for i in range(1,n+1):
r=r*i
print((r%(10**9+7))) | n=int(eval(input()))
r=1
for i in range(1,n+1):
r=r*i%(10**9+7)
print(r) | p03796 |
n = int(eval(input()))
ans =1
mod = 10**9+7
for i in range(1, n+1):
ans =((ans%mod)*(i%mod))%mod
ans = ans%mod
print(ans) | #Noob
n = int(eval(input()))
ans =1
mod = 10**9+7
for i in range(1, n+1):
ans =((ans%mod)*(i%mod))%mod
ans = ans%mod
print(ans) | p03796 |
# B
N = int(eval(input()))
ans = 1
for i in range(1, N+1):
ans *= i
print((ans % (10 ** 9 + 7))) | # B
import math
N = int(eval(input()))
print((math.factorial(N) % (10 ** 9 + 7))) | p03796 |
N = int(eval(input()))
prod = 1
for j in range(1, N+1):
prod *= j
print((prod%int(1e9+7))) | import math
print((math.factorial(int(eval(input())))%int(1e9+7))) | p03796 |
import math
N=eval(input())
r=math.factorial(N)
print(r%(10**9+7)) | N=eval(input())
r=1
for i in range(N):
r=r*(i+1)
r=r%(10**9 + 7)
print(r)
| 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()))
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 |
INF = 1000000000 + 7
N = int(eval(input()))
ans = 1
for i in range(1, N + 1):
ans *= i
print((ans % INF))
| INF = 1000000000 + 7
N = int(eval(input()))
ans = 1
for i in range(1, N + 1):
ans = ans * i % INF
print(ans)
| p03796 |
if __name__ == '__main__':
N = int(eval(input()))
ans = 1
for i in range(1,N+1) :
ans *= i
ans %= 1000000007
print(ans)
| if __name__ == '__main__':
N = int(eval(input()))
ans = 1
for i in range(1,N+1) :
ans *= i
# 剰余演算の分配則
ans %= 1000000007
ans %= 1000000007
print(ans)
| p03796 |
sum = 1
for i in range(1,int(eval(input()))+1):
sum *= i
print((sum%1000000007))
| sum = 1
for i in range(1,int(eval(input()))+1):
sum *= i
sum %= 1000000007
print(sum)
| p03796 |
import math
print((math.factorial(int(eval(input())))%(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%(10**9+7)
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()))
r = 1
for i in range(n):
r = r * (i + 1)
r = r % (10**9 + 7)
print(r) | n = int(eval(input()))
r = 1
for i in range(n):
r = (r * (i + 1)) % (10**9 + 7)
print(r) | p03796 |
n=int(eval(input()))
i=1
for j in range(1,n+1):
i*=j
print((i%(10**9+7))) | n=int(eval(input()))
i=1
for j in range(1,n+1):
i*=j
i%=10**9+7
print(i) | p03796 |
N = int(eval(input()))
power = 1
for i in range(1,N+1):
power *= i
power = power % (10**9+7)
print(power) | N = int(eval(input()))
power = 1
C = 10**9+7
for i in range(1,N+1):
power *= i
power %= C
# power = power % (10**9+7)
print(power) | p03796 |
n=eval(input())
n=int(n)
a=1
for i in range(n):
a=a*(i+1)
if a>=pow(10,9)+7:
a=a%(pow(10,9)+7)
print(a) | 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()))
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
import math
a=math.factorial(n)
# ans=1
# for i in range(1,n+1):
# ans*=i
print((a%mod))
| p03796 |
N = int(eval(input()))
r = 1
for n in range(1, N + 1):
r *= n
print((r % ((10 ** 9) + 7))) | N = int(eval(input()))
r = 1
for n in range(1, N + 1):
r = (r * n) % ((10 ** 9) + 7)
print(r) | p03796 |
n = int(eval(input()))
ans = 1
for i in range(n):
ans *= i + 1
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 |
DIV=10**9+7
N=int(eval(input()))
ans=1
while N>0:
ans*=N
N-=1
print((ans%DIV))
| N=int(eval(input()))
ans=1
DIV=10**9+7
while N>1:
ans=(ans*(N%DIV))%DIV
N-=1
print(ans) | p03796 |
N=int(eval(input()))
ans=1
DIV=10**9+7
while N>1:
ans=(ans*(N%DIV))%DIV
N-=1
print(ans) | N=int(eval(input()))
p=1
DIV=10**9+7
for i in range(1,N+1):
p = (p%DIV * i%DIV) % DIV
print(p) | p03796 |
N = int(eval(input()))
p = 1
m = int(1e+9 + 7)
for i in range(1, N + 1):
p = p * i
if p > m:
p = p % m
print(p) | n = int(eval(input()))
p = 1
mod = 1000000007
for i in range(1, n + 1):
p *= i
p = p % mod
print(p) | p03796 |
n=int(eval(input()))
a=1
for i in range(1,n+1):
a=a*i
print((a%(1000000000+7))) | n=int(eval(input()))
a=1
for i in range(1,n+1):
a=a%(1000000000+7)*i%(1000000000+7)
print((a%(1000000000+7))) | p03796 |
n=int(eval(input()))
x=1
for i in range(1,n+1):
x=x*i
print((x%(10**9+7))) | n=int(eval(input()))
x=1
for i in range(1,n+1):
x=x*i
x=x%(10**9+7)
print(x) | p03796 |
INF = float('inf')
MOD = 1000000000 + 7
def solve():
power = 1
for i in range(1, int(eval(input())) + 1):
power *= i
print((power % MOD))
solve() | import math
MOD = 10**9 + 7
N = int(eval(input()))
print((math.factorial(N) % MOD)) | p03796 |
N = int(eval(input()))
num = 1
for i in range(1, N+1):
num = num * i
if num < (10**9 + 7):
print(num)
else:
print((num % (10**9 + 7))) | N = int(eval(input()))
num = 1
for i in range(1, N+1):
num = i * num % (10**9 + 7)
print(num) | p03796 |
N=eval(input())
N=int(N)
p=1
for i in range(1,N+1):
p=p*i
print((p%((10**9)+7))) | import math
N=eval(input())
N=int(N)
print((math.factorial(N)%((10**9)+7))) | p03796 |
n = int(eval(input()))
prod = 1
for i in range(1,n+1):
prod *= i
print((int(prod%(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()))
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
for i in range(1,N+1):
p = (p*i)%(10**9+7)
print((p%(10**9+7))) | 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 |
# -*- coding: utf-8 -*-
import sys
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i
print((p % 1000000007))
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
def main():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = (p * i) % 1000000007
print(p)
if __name__ == "__main__":
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()))
po = 1
for i in range(1,N+1):
po *= i
print((po%(1000000007))) | import math
N = int(eval(input()))
po = math.factorial(N)
print((po%(1000000007))) | p03796 |
n = int(eval(input()))
p = 1
for i in range(1,n+1):
p = p * i
print((p%((10**9)+7))) | import math
n = int(eval(input()))
C = 10**9 + 7
print((math.factorial(n)%C)) | p03796 |
n=int(eval(input()))
x=1
for i in range(1,n+1):
x=x*(i%(10**9+7))
print((x%(10**9+7))) | n=int(eval(input()))
x=1
for i in range(1,n+1):
x=x*(i%(10**9+7))
x=x%(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 % 1000000007
print(p) | p03796 |
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p = p * i % 1000000007
print(p) | n = int(eval(input()))
def training(n):
power = 1
for i in range(1, n+1):
power = power * i % 1000000007
return power
print((training(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=power%(10**9+7)
print((power%(10**9+7))) | p03796 |
N = int(eval(input()))
power_level = 1
for i in range(N):
power_level *= (i + 1)
print((power_level % (10**9 + 7))) | N = int(eval(input()))
power_level = 1
for i in range(N):
power_level *= (i + 1)
power_level %= (10**9 + 7)
print(power_level) | p03796 |
def main():
N = int(eval(input()))
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
ans *= i
print((ans % mod))
if __name__ == "__main__":
main()
| import math
def main():
N = int(eval(input()))
ans = math.factorial(N)
mod = 10**9 + 7
print((ans % mod))
if __name__ == "__main__":
main()
| 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()))
ans = 1
for i in range(1, n + 1):
ans *= i
ans = ans % (10 ** 9 + 7)
print(ans) | p03796 |
import math
N = int(eval(input()))
print((math.factorial(N) % (1000000000 + 7)))
| import math
N = int(eval(input()))
p = 1
for i in range(2, N+1):
p *= i
p = p % (1000000000 + 7)
print(p)
| p03796 |
n = int(eval(input()))
mod = 10**9 + 7
ans = 1
for i in range(1,n + 1):
ans *= i
#print(ans % mod)
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()))
sum=1
for i in range(1, N+1):
sum = (sum*i)
print((sum%1000000007)) | N = int(eval(input()))
sum=1
for i in range(1, N+1):
sum=(sum*i)%1000000007
print(sum) | p03796 |
N = int(eval(input()))
p=1
mod=10**9+7
for i in range(1,N+1):
p = p*i
print((p%mod)) | N = int(eval(input()))
p=1
mod=10**9+7
for i in range(1,N+1):
p = (p*i)%mod
print(p)
| p03796 |
def abc():
n = int(eval(input()))
p = 1
for i in range(1, n+1):
p *= i
print((p % (10 ** 9 + 7)))
abc()
| def abc():
import math
n = int(eval(input()))
print((math.factorial(n) % (10 ** 9 + 7)))
abc()
| 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=ans*i%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()))
ans = 1
for i in range(1,N+1):
ans = (i * ans) % (10**9+7)
print(ans) | p03796 |
N=int(eval(input()))
for i in range(1,N):
N*=i
print((N%((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 |
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 |
import math
print(math.factorial(int(input()))%(10**9+7)) | mod=10**9+7
ans=1
for i in range(int(input())):
ans*=i+1
ans%=mod
print(ans) | p03796 |
import math
mod = 10 ** 9 + 7
n = int(eval(input()))
print((math.factorial(n) % mod)) | mod = 10 ** 9 + 7
n = int(eval(input()))
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(1, n + 1):
ans *= i
ans %= (10 ** 9 + 7)
print(ans) | p03796 |
N = int(eval(input()))
mod = 10**9+7
for i in range(1, N):
N *= i % mod
print((N % mod))
| N = int(eval(input()))
mod = 10**9+7
for i in range(1, N):
N *= i
N %= mod
print((N % mod)) | 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()))
p=1
for i in range(1, n+1):
p = 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()))
x=1
for i in range(n):
x*=(i+1)
print((x%(10**9+7)))
| n=int(eval(input()))
x=1
for i in range(n):
x*=(i+1)
if x>10**9+7:
x=x%(10**9+7)
print(x)
#import numpy as np
#n=int(input())
#print(np.prod([i+1 for i in range(n)]))
#print(np.prod([i+1 for i in range(n)])%((10**9)+7))
#オーバーフロー？
| p03796 |
n=int(eval(input()))
x=1
for i in range(n):
x*=(i+1)
if x>10**9+7:
x=x%(10**9+7)
print(x)
#import numpy as np
#n=int(input())
#print(np.prod([i+1 for i in range(n)]))
#print(np.prod([i+1 for i in range(n)])%((10**9)+7))
#オーバーフロー？
| power=1
n=int(eval(input()))
mod=10**9+7
for i in range(1,n+1):
power*=i
power%=mod
#print(power)
print(power)
| p03796 |
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
import bisect
def main():
n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(n):
ans *= i+1
print((ans%mod))
... | import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
import bisect
def main():
n = int(eval(input()))
mod = 10**9+7
ans = 1
for i in range(n):
ans *= i+1
ans %= mod
... | p03796 |
n = int(eval(input()))+1
num = 10**9+7
power = 1
for i in range(1, n):
power = power * i
ans = power % num
print(ans) | n = int(eval(input())) + 1
mod = 10**9 + 7
power = 1
for i in range(1, n):
power *= i
power %= mod
print(power) | 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 % 1000000007))
| p03796 |
n = int(eval(input()))
pw = 1
for i in range(n):
pw *= i+1
print((pw%(10**9+7))) | import math
n = int(eval(input()))
pw = math.factorial(n)
print((pw%(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()))
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()))
X=0
for i in range(20000000):
X=X+N%10
N=N//10
if N<1:
break
if X%9==0:
print('Yes')
else:
print('No') | N=int(eval(input()))
if N%9==0:
print('Yes')
else:
print('No') | p02577 |
n = int(eval(input()))
result = sum(list(map(int, str(n))))
if result % 9 == 0:
print('Yes')
else:
print('No') | n = int(eval(input()))
if n % 9 == 0:
print('Yes')
else:
print('No') | p02577 |
N = int(eval(input()))
if sum(int(i) for i in list(str(N))) % 9 == 0:
print('Yes')
else:
print('No') | N = str(eval(input()))
cnt = 0
for i in range(10):
cnt += i * N.count(str(i))
print(('Yes' if cnt % 9 == 0 else 'No')) | p02577 |
n=int(eval(input()))
s=0
while n>0:
r=n%10
s=s+r
n=n//10
if s%9==0:
print('Yes')
else:
print('No') | n=eval(input())
u=sum(map(int, str(n)))
if u%9==0:
print('Yes')
else:
print('No')
| p02577 |
N = int(eval(input()))
sum = 0
while N:
a = N%10
sum += a
N = N//10
if sum%9==0:
print("Yes")
else:
print("No") | def digitSum(n):
s = str(n)
array = list(map(int, s))
return sum(array)
N = int(eval(input()))
sum = digitSum(N)
if sum%9==0:
print("Yes")
else:
print("No") | p02577 |
import sys
n = int(eval(input()))
ans = 0
while n>0:
ans += n%10
n = n//10
#print(ans)
if ans%9 == 0:
print("Yes")
else:
print("No")
| def digitSum(n):
# 数値を文字列に変換
s = str(n)
# １文字ずつ数値化し配列にする。
array = list(map(int, s))
# 合計値を返す
return sum(array)
n = int(eval(input()))
ans = digitSum(n)
#print(ans)
if ans%9 == 0:
print("Yes")
else:
print("No")
| p02577 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
x = int(read())
print(('Yes' if x % 9 == 0 else 'No'))
| x = int(eval(input()))
print(('Yes' if x % 9 == 0 else 'No'))
| p02577 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.