标签:
from math import* n = int(raw_input()) s=0 for x in range(1,n+1): s=s+factorial(x) s = str(s) length = len(s) #print s[length-6:length:1] if s[length-6]==‘0‘: print s[length-5:length:1] else: print s[length-6:length:1]
#include<stdio.h> #include<time.h> int main() { const int MOD=1000000; int i,j,n,S=0; scanf("%d",&n); for(i=1;i<=n;i++) { int factorial=1; for(j=1;j<=i;j++) factorial=factorial*j%MOD; S=(S+ factorial)%MOD; } printf("%d\n",S); printf("Time used = %0.2lf",(double)%clock()/CLOCKS_PER_SEC); return 0; }
标签:
原文地址:http://www.cnblogs.com/test404/p/5371641.html