s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s799670386 | p03796 | u479638406 | 1586529889 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3460 | 82 | n = int(input())
v = 1
for i in range(n):
v = v*(i+1)
print(int(v%(1e9+7)))
|
s614998418 | p03796 | u852790844 | 1586474319 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | n = int(input())
mod = 10**9 + 7
for i in range(1, n+1):
ans *= i
ans %= mod
print(ans) |
s525124985 | p03796 | u852790844 | 1586473648 | Python | Python (3.4.3) | py | Runtime Error | 94 | 4444 | 191 | from functools import lru_cache
@lru_cache(maxsize=None)
def fac(n, mod = 10**9+7):
if n == 0:
return 1
else:
return fac(n-1) * n % mod
n = int(input())
print(fac(n)) |
s200878312 | p03796 | u581603131 | 1586459024 | Python | Python (3.4.3) | py | Runtime Error | 230 | 3976 | 62 | import math
N = int(input())
print(math.factorial(N)/(10*9+7)) |
s464212310 | p03796 | u745562158 | 1586276253 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | N = int(input())
import math
N! = math.factorial(N)
print(N!) |
s801633600 | p03796 | u693007703 | 1586186412 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3884 | 190 | def factorial_power(n):
if n == 0:
return 1
else :
return n * factorial_power(n-1)
divisor = (10 ** 9) + 7
N = int(input())
print(factorial_power(N) % divisor) |
s984641755 | p03796 | u038685094 | 1585863764 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | import math
N = int(input())
print(factrial(N)%(10**9+7)) |
s227638883 | p03796 | u038685094 | 1585863646 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | import math
N = int(inport())
print(math.factorial(N)%(10**9+7)) |
s898665747 | p03796 | u038685094 | 1585863600 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | import math
N = int(inport())
print(math.factrial(N)%(10**9+7)) |
s591468029 | p03796 | u038685094 | 1585863546 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | import math
N = int(inport())
print(factrial(N)%(10**9+7)) |
s426205692 | p03796 | u440161695 | 1585759462 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | import math
print(math.factorial(int(input()))%(10**9+7) |
s765389673 | p03796 | u659142359 | 1585743909 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 104 | n = int(input())
power = 1
for i in range(1,n+1):
power = power * i
print(powe r% (pow(10,9) + 7)) |
s954860354 | p03796 | u038408819 | 1585596084 | Python | Python (3.4.3) | py | Runtime Error | 230 | 4020 | 60 | N = int(input())
import math
print(math.factorial(N) % big) |
s659404589 | p03796 | u920621778 | 1585530820 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2112 | 133384 | 87 | n = int(input())
r = 1
for i in range(n):
r = r * (i + 1)
r = r / (10**9 + 7)
print(r) |
s908596079 | p03796 | u731665172 | 1585001041 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | import math
N=int(input)
print(math.factorial(N)%(10**9+7)) |
s159422389 | p03796 | u024782094 | 1584827892 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 61 | import math
a=int(input())
print(math.factorial(n)%(10**9+7)) |
s881920630 | p03796 | u024782094 | 1584827857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | import math
a=int(input())
print(math.factorial(n)%(10**9+7)) |
s395090648 | p03796 | u024782094 | 1584827825 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 61 | a=int(input())
import math
print(math.factorial(n)%(10**9+7)) |
s055641691 | p03796 | u024782094 | 1584827795 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | a=input()
import math
print(math.factorial(n)%(10**9+7)) |
s389882551 | p03796 | u630027862 | 1584399807 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | N = int(input())
P = 1
for n in range(1,N + 1):
P = P * n
print(P %% ((10**9) + 7)) |
s481019714 | p03796 | u478266845 | 1584343443 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3940 | 166 | N=int(input())
mod_lar = 10**9+7
def fact_mod(n):
if n==1:
return 1
ans = int((n%mod_lar)*(fact_mod(n-1)%mod_lar))
return ans
print(fact_mod(N)) |
s675980677 | p03796 | u223663729 | 1584338151 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | n = int(input)
p = 1
for i in range(2, n+1):
p = p*i%(10**9+7)
print(p) |
s642719631 | p03796 | u137808818 | 1583640782 | Python | Python (3.4.3) | py | Runtime Error | 230 | 3984 | 110 | import math
n=int(input())
n =math.factorial(n)
m = (10**9) + 7
if n < m:
prtint(n)
else :
print(n%m) |
s189950182 | p03796 | u968649733 | 1583446393 | Python | Python (3.4.3) | py | Runtime Error | 228 | 4024 | 59 | import math
print(math.factorial(int(input())) /(10**9 +7)) |
s923426948 | p03796 | u576917603 | 1583438183 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | def training(n):
if n==1:
return 1
else:
x=training(n-1)*n
return x%mod
import sys
sys.setrecursionlimit(n+1)
n=int(input())
mod=10**9+7
print(training(n)) |
s177181368 | p03796 | u835924161 | 1583411523 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | n=int(input())
ans=int(1)
for i in range(1,n+1):
ans*=i
ans%=1000000007
print(ans) |
s011453337 | p03796 | u699089116 | 1583300069 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 88 | import math
n = int(input())
ans = math.factional(n)
s = 10**9 + 7
print(ans % s) |
s320631182 | p03796 | u312078744 | 1582499073 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | import math
time = int(input())
p = math.factrial(time)
mod = p % (10**9+7)
print(mod) |
s545345827 | p03796 | u419963262 | 1582356120 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | N=int(input())
ans=1
for i in range(1,n+1):
ans=(ans*i)%1000000007
print(ans%(10**9+7)) |
s359891663 | p03796 | u133936772 | 1581659967 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | p = 1
for i in range(n):
p = p*(i+1)%(10**9+7)
print(p) |
s400557742 | p03796 | u977661421 | 1581577254 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 268 | #include <stdio.h>
#include <math.h>
int main(void){
long int n;
scanf("%ld", &n);
long int ans = 1;
long int tmp = pow(10, 9);
for (long int i = 1; i <= n; i++){
ans = ans * i;
}
printf("%ld\n", ans % (tmp + 7));
return 0;
}
|
s055689861 | p03796 | u609814378 | 1581180873 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | from math import factorial
N = int(input())
N2=math.factorial(N)
print((N2)%(10 ** 9 + 7)) |
s025104059 | p03796 | u609814378 | 1581180787 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 59 | N = int(input())
N2=math.factorial(N)
print(N2%1000000007) |
s627130070 | p03796 | u127499732 | 1581134844 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 64 | ans=1
for i in range(int(iput())):
ans*=i%(10**9+7)
print(ans) |
s561711932 | p03796 | u225388820 | 1580834283 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 76 | n=int(input())
mod=10**9+7
for i in range(1,n+1):
ans=ans*i%mod
print(ans) |
s410862425 | p03796 | u457554982 | 1580750512 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 266 | n=int(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**)+7
print(ans%(10**9+7)) |
s551924605 | p03796 | u457554982 | 1580749758 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3892 | 125 | n=int(input())
def kaijo(n):
if n==0:
return(1)
else:
return(n*kaijo(n-1))
print(kaijo(n)%(10**9+7))
|
s431980764 | p03796 | u287880059 | 1580623685 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | import math
n = int(input())
print(math.factorial(n)%(10**9+7) |
s188928719 | p03796 | u287880059 | 1580623610 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | import math
n = int(input())
print(math.factorial(n)%(10**9+7) |
s995734654 | p03796 | u905743924 | 1580603281 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | N = int(input())
mod = int(1e9+7)
for j in range(1, N+1):
prod = j * (prod%mod)
print(prod) |
s956832048 | p03796 | u905743924 | 1580602674 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3464 | 80 | N = int(input())
prod = 1
for j in range(1, N+1):
prod *= j
print(prod%(1e9+7)) |
s768915114 | p03796 | u072717685 | 1580591136 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | n = int(input())
r = 1
w = 10**9 + 7
for i in range(n):
r = (r * i) % x
print(r) |
s861408653 | p03796 | u072717685 | 1580591111 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | n = int(input())
r = 1
w = 10**9 + 7
for i in range(n):
r = r * i / x
print(r) |
s035187459 | p03796 | u846652026 | 1579715576 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | import math
print(math.factrial(int(input))%(10**9+7)) |
s968827916 | p03796 | u185249212 | 1579711697 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 1381 | from __future__ import print_function
import sys
input = sys.stdin.readline
def eprint(*args, **kwargs):
print(*args, file=sys.stderr, **kwargs)
return
# import re
# import array
# import copy
# import functools
# import operator
# import math
# import string
# import fractions
# from fractions import Fraction
# from fractions import gcd
from math import gcd
# import collections
# import itertools
# import bisect
# import heapq
# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace
# from queue import PriorityQueue as pq
from queue import Queue
# from itertools import accumulate
# from collections import deque
# from collections import Counter
# from operator import mul
# from functools import reduce
# def lcm(n,m):
# return int(n*m/gcd(n,m))
# def reduce(p, q):
# common = fractions.gcd(p, q)
# return (p//common , q//common )
# def combinations_count(n, r):
# r = min(r, n - r)
# numer = reduce(mul, range(n, n - r, -1), 1)
# denom = reduce(mul, range(1, r + 1), 1)
# return numer // denom
# import random
# import time
def main():
n = int(input().strip())
temp = 1
for i in range(1, n + 1):
temp *= i
temp = temp % (10**9 + 7)
print(temp)
return
if __name__ == '__main__':
main()
|
s291941541 | p03796 | u185249212 | 1579711496 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38256 | 1381 | from __future__ import print_function
import sys
input = sys.stdin.readline
def eprint(*args, **kwargs):
print(*args, file=sys.stderr, **kwargs)
return
# import re
# import array
# import copy
# import functools
# import operator
# import math
# import string
# import fractions
# from fractions import Fraction
# from fractions import gcd
from math import gcd
# import collections
# import itertools
# import bisect
# import heapq
# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace
# from queue import PriorityQueue as pq
from queue import Queue
# from itertools import accumulate
# from collections import deque
# from collections import Counter
# from operator import mul
# from functools import reduce
# def lcm(n,m):
# return int(n*m/gcd(n,m))
# def reduce(p, q):
# common = fractions.gcd(p, q)
# return (p//common , q//common )
# def combinations_count(n, r):
# r = min(r, n - r)
# numer = reduce(mul, range(n, n - r, -1), 1)
# denom = reduce(mul, range(1, r + 1), 1)
# return numer // denom
# import random
# import time
def main():
n = int(input().strip())
temp = 1
for i in range(1, n + 1):
temp *= i
temp = temp % (10**9 + 7)
print(temp)
return
if __name__ == '__main__':
main()
|
s596801792 | p03796 | u215286521 | 1579704105 | Python | Python (3.4.3) | py | Runtime Error | 75 | 3884 | 142 | n = int(input())
num = 10**9 + 7
def factorial(n):
if n == 1:
return n
return n * factorial(n-1)
print(factorial(n) % num) |
s366360942 | p03796 | u215286521 | 1579703965 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 141 | n = int(input())
num = 10**9 + 7
print(factorial(n) % numß)
def factorial(n):
if n == 1:
return n
return n * factorial(n-1) |
s981569070 | p03796 | u957872856 | 1577878080 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | import math
print(math.factorial(int(input())%10**9+7) |
s652550969 | p03796 | u076764813 | 1577716170 | Python | Python (3.4.3) | py | Runtime Error | 231 | 3980 | 64 | import math
n=int(input())
print(math.factorial(n)/(10**9+7))
|
s540454519 | p03796 | u309141201 | 1577149801 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3896 | 142 | N = int(input())
mod = 10 ** 9 + 7
def fact(n):
if n == 1:
return 1
return n * fact(n-1)
answer = fact(N)
print(answer % mod) |
s993862313 | p03796 | u309141201 | 1577149747 | Python | Python (3.4.3) | py | Runtime Error | 74 | 3892 | 119 | N = int(input())
def fact(n):
if n == 1:
return 1
return n * fact(n-1)
answer = fact(N)
print(answer) |
s581713711 | p03796 | u102242691 | 1577075808 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 107 |
n = int(input())
power = 1
for i in range(1,n+1):
power *= i
ans = ans % (10**9 + 7)
print(ans)
|
s151412180 | p03796 | u609814378 | 1577030689 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1 | a |
s075916214 | p03796 | u721425712 | 1576644050 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3896 | 128 | def fact(n):
if n == 1:
return n
else:
return n*fact(n-1)
n = int(input())
print(fact(n)%(10**9+7)) |
s201988269 | p03796 | u721425712 | 1576628341 | Python | Python (3.4.3) | py | Runtime Error | 71 | 3912 | 128 | def fact(n):
if n == 1:
return n
else:
return n*fact(n-1)
n = int(input())
print(fact(n)%(10**9+7)) |
s241586433 | p03796 | u994521204 | 1576099672 | Python | Python (3.4.3) | py | Runtime Error | 55 | 7064 | 135 | N=int(input())
mod=10**9+7
bikkuri=[1 for i in range(N+1)]
for i in range(N+1):
bikkuri[i+1]=((i+1)*bikkuri[i])%mod
print(bikkuri[N]) |
s983161914 | p03796 | u994521204 | 1576099615 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 121 | N=int(input())
mod=10**9+7
bikkuri=[1*(N+1)]
for i in range(N+1):
bikkuri[i+1]=((i+1)*bikkuri[i])%mod
print(bikkuri[N]) |
s791802918 | p03796 | u780475861 | 1575663127 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3896 | 135 | n = int(input())
mod = 10 ** 9 + 7
def a(n):
if n == 1:
return n
else:
return n * (a(n - 1))
print(a(n) % mod) |
s785495448 | p03796 | u668715715 | 1575169534 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3892 | 109 | def kaijo(n):
if n ==1:
return n
return n * kaijo(n-1)
n = int(input())
print(kaijo(n)%1000000007)
|
s504810691 | p03796 | u876688988 | 1572906377 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38332 | 132 | import numpy as np
power = 1
n = int(input())
tmp = 10 ** 9 + 7
for i in range(n):
power = power * (i + 1)
print(power % tmp) |
s057420141 | p03796 | u876688988 | 1572905668 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38640 | 132 | import numpy as np
power = 1
n = int(input())
tmp = 10 ** 9 + 7
for i in range(n):
power = power * (i + 1)
print(power % tmp) |
s473780154 | p03796 | u876688988 | 1572905648 | Python | PyPy2 (5.6.0) | py | Runtime Error | 35 | 27756 | 132 | import numpy as np
power = 1
n = int(input())
tmp = 10 ** 9 + 7
for i in range(n):
power = power * (i + 1)
print(power % tmp) |
s156250100 | p03796 | u528720841 | 1572709614 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | N = int(input())
ans = 1
for i in range(1, N+1):
(ans *= i) %= 1000000007
print(ans) |
s845637349 | p03796 | u884657429 | 1571373513 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 121 | n, m = map(int, input().split())
if 2 * n >= m:
print(m // 2)
else:
a = m - 2 * n
b = a // 4
print(n + b) |
s598587699 | p03796 | u143100985 | 1571342626 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38384 | 112 | sum = 1
N = int(input())
for i in range(N):
sum *= (i+1)
sum = sum % 1000000007
print(sum%1000000007)
|
s935101196 | p03796 | u143100985 | 1571331963 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38768 | 111 | sum = 1
N = int(input())
for i in range(N):
sum *= (i+1)
sum = sum % 1000000007
print(sum%1000000007)
|
s196376980 | p03796 | u399155892 | 1571261449 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 113 | N = int(input())
N = int(input())
power = 1
for i in range(N):
power = power*(i+1) % (10**9+7)
print(power) |
s464651314 | p03796 | u399155892 | 1571261286 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 153 | N = int(input())
N = int(input())
power = 1
for i in range(N):
power = power*(i+1)
if power > 10**9+7:
power = power % (10**9+7)
print(power) |
s790272095 | p03796 | u399155892 | 1571261185 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | N = int(input())
N = int(input())
power = 1
for i in range(N):
power = power*(i+1)%(10**9+7)
print(power) |
s875288161 | p03796 | u444722572 | 1570856728 | Python | Python (3.4.3) | py | Runtime Error | 232 | 3976 | 61 | import math
N=int(input())
print(math.factorial(N)/(10**9+7)) |
s939706033 | p03796 | u021337285 | 1570037329 | Python | Python (3.4.3) | py | Runtime Error | 77 | 4912 | 344 | N = int(input())
def time_memo(n):
memo = [0]*(n+1)
def _time(n):
if n <= 0:
return 0
elif n == 1:
return 1
elif memo[n] != 0:
return memo[n]
else:
memo[n] = _time(n-1)*n
return memo[n]
return _time(n)
print(time_memo(N) % (10 ^ 9+7))
|
s051396380 | p03796 | u021337285 | 1569533810 | Python | Python (3.4.3) | py | Runtime Error | 74 | 3892 | 167 | N = int(input())
def time(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return time(n-1) * n
print(time(N) % (10 ^ 9+7))
|
s181479316 | p03796 | u021337285 | 1569533486 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3892 | 154 | N = int(input())
def time(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return time(n-1) * n
print(time(N))
|
s878735993 | p03796 | u224050758 | 1569464502 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 183 | N = int(input())
def main():
ans = 1
t = 0
while t < N:
t += 1
ans *= t
ans %= 1_000_000_007
print(ans)
if __name__ == '__main__':
main() |
s890332003 | p03796 | u325956328 | 1569168546 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | n = int(input())
ans = factorial(n) % (10 ** 9 + 7)
print(ans)
|
s539671542 | p03796 | u215743476 | 1569091976 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | n = input()
m = n ** (n-1)
print( m % (10 ** 9 + 7)) |
s276942688 | p03796 | u167908302 | 1568942684 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 124 | #coding:utf-8
n = int(input())
power = 1
for i in range(0,n):
power = ((i+1) * power) % (7 + 10＊＊９)
print(power)
|
s928354321 | p03796 | u167908302 | 1568942570 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 121 | #coding:utf-8
n = int(input())
power = 1
for i in range(n):
power = ((i+1) * power) % (7 + 10＊＊９)
print(power) |
s956866061 | p03796 | u252523823 | 1568860858 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 92 | N = int(input())
ans: int = 1
for i in range(1, N+1):
ans = ans * i
print(ans%(10**9+7)) |
s124182802 | p03796 | u252523823 | 1568860757 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | N = int(input())
ans: int = 1
for i in range(1, N+1):
ans = ans * i
print(ans%(10**9+7)) |
s254680510 | p03796 | u985596066 | 1568173426 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | import math
n = int(input())
print(math.factorial(n) % (10**9+7) |
s855887991 | p03796 | u985596066 | 1568058679 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | n = int(input())
p=1
for i in range(1, n+1):
p = i*(p % (10**9 + 7))
print(p |
s143368985 | p03796 | u985596066 | 1568058280 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | n = int(input())
p=1
for i in range(1, n+1):
p = p*i
print(p % (10**9 + 7) |
s235149656 | p03796 | u985596066 | 1568058193 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | n = int(input())
p=1
for i in range(1, n+1):
p = p*i
print(p % (10**9 + 7) |
s877904132 | p03796 | u474925961 | 1568056780 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
import math
print(math.factorial(n)%(10**9+7)) |
s404880991 | p03796 | u578378372 | 1567182622 | Python | Python (3.4.3) | py | Runtime Error | 230 | 3984 | 61 | import math
n=int(input())
print(math.factorial(n)/10**9+7) |
s908129461 | p03796 | u357630630 | 1566873797 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | A=1
for i in range(1,int(input)+1):
A*=i
A%=1000000007
print(A) |
s399454521 | p03796 | u488127128 | 1566857539 | Python | Python (3.4.3) | py | Runtime Error | 34 | 2940 | 107 | N = int(input())
power_r = 1
for n in range(2,N+1):
power_r = power_r*n % (10**9+7)
print(factorial(N)) |
s914445831 | p03796 | u901582103 | 1566528941 | Python | Python (3.4.3) | py | Runtime Error | 71 | 3900 | 92 | def t(n):
if n==1:
return 1
return n*t(n-1)
print(t(int(input()))%(10**9+7)) |
s692707114 | p03796 | u901582103 | 1566528847 | Python | Python (3.4.3) | py | Runtime Error | 77 | 3900 | 82 | def t(n):
if n==1:
return 1
return n*t(n-1)
print(t(int(input()))) |
s439951254 | p03796 | u265118937 | 1566418900 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | import math
print(math.factorial(n)%(10**9+7)) |
s735219195 | p03796 | u265118937 | 1566418783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | import math
print(math(factorial(n))%(10**9+7)) |
s594371255 | p03796 | u923561222 | 1566091982 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | import math
print(math.factorial(int(input()) % (10**9+7)) |
s485499575 | p03796 | u923561222 | 1566091884 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | import math
print(math.factorial(int(input())%10**9+7) |
s776111405 | p03796 | u619785253 | 1566076286 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3468 | 77 | N = int(input())
p = 1
for i in range(1,N+1):
p*=i
print(p/(10**9+7) ) |
s289499629 | p03796 | u604231488 | 1565899778 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | import math
print(math.factorial(int(input())) % (10**9+7)))
|
s430374254 | p03796 | u508141157 | 1565873131 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | import math
print(math.factrial(int(input()))%(10**9+7)) |
s835089091 | p03796 | u508141157 | 1565873108 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | import math
print(math.factrial(int(input()))//(10**9+7)) |
s576676147 | p03796 | u491762407 | 1565844642 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | import math
N = int(input())
print((math.factoral(N))%(10**9 + 7))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.