1288:阶乘之和
Description
输入n,计算S=1!+2!+3!+...+n!的末尾6位(不含前导0),n<=1000000,这里n!=1*2*3*4*5*..n
Input
输入n
Output
计算S=1!+2!+3!+...+n!的末尾6位(不含前导0),
Sample INput
10
Sample Output
37913
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int count=0;
for(int i=1;i<=n;i++)
{
int sum=1;
for(int j=1;j<=i;j++)
sum=sum*j%1000000;
count=count+sum;
}
cout<<count%1000000<<endl;
return 0;
}