Calculate S(n)
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5403 Accepted Submission(s): 2014
Problem Description
Calculate S(n).
S(n)=1 3+2 3 +3 3 +......+n 3 .
S(n)=1 3+2 3 +3 3 +......+n 3 .
Input
Each line will contain one integer N(1 < n < 1000000000). Process to end of file.
Output
For each case, output the last four dights of S(N) in one line.
Sample Input
1 2
Sample Output
0001 0009
Author
天邪
Source
Recommend
威士忌
对于这个问题我一直很纠结 因为一直报错了 最后才可以运行并AC了 呵呵下面贴一下代码哦
#include<iostream>
#include<iomanip>
#include<cstdio>
using namespace std;
int main()
{
_int64 n,sum;
while(cin>>n)
{
n=n%10000;
sum=(n*n*(n+1)*(n+1)/4);//立方和公式
sum%=10000;
cout<<setfill('0')<<setw(4)<<sum<<endl;
}
return 0;
}