Calculate S(n)
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4983 Accepted Submission(s): 1889
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
天邪
连续的求平方的公式是 1*1+2*2+3*3+4*4---- n*(n+1)*(2n+1)/6
连续的求立方的公式是 1*1*1+2*2*2+3*3*3+4*4*4 n*n*(n+1)*(n+1)/4
直接套用公式mod就可以了
post code:
#include<stdio.h>
int main()
{
__int64 num;
int num1;
while(scanf("%I64d",&num)!=EOF )
{
num=num%1000000;
num= ( (num*num)%1000000*( (num+1)*(num+1) )%1000000 )%1000000/4;
num1=(int) (num%10000);
printf("%04d\n",num1);
}
}