Calculate S(n)
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6292 Accepted Submission(s): 2384
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
威士忌
#include<stdio.h>
int main()
{
__int64 n,sum;
while(scanf("%I64d",&n)!=EOF)
{
n%=10000;
sum=(n*(n+1)/2)*(n*(n+1)/2)%10000;
printf("%04I64d\n",sum);
}
return 0;
}
正整数范围中
![1^3+2^3+\cdots+n^3=[\frac{n(n+1)}{2}]^2=(1+2+\dots\dots+n)^2 1^3+2^3+\cdots+n^3=[\frac{n(n+1)}{2}]^2=(1+2+\dots\dots+n)^2](https://i-blog.csdnimg.cn/blog_migrate/d07dded4da80c04a47963c39b96db64b.png)