Calculate S(n)

Calculate S(n)

Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8215    Accepted Submission(s): 2998

Problem Description

Calculate S(n).

S(n)=1 ³+2 ³ +3 ³ +......+n ³ .

 

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

天邪

 

#include <stdio.h>
int main()
{
	__int64 sum,n;
	while (scanf("%I64d",&n)!=EOF)
	{
         sum=(n*(n+1)/2%10000)*(n*(n+1)/2%10000)%10000;
		 printf("%04I64d\n",sum);
	}
}

<span style="font-size:32px;color:#ff0000;">运用到立方和公式以及求模公式</span>

<span style="font-size:32px;color:#ff0000;">立方和公式为<span style="font-family: 'Hiragino Sans GB W3', 'Hiragino Sans GB', Arial, Helvetica, simsun, u5b8bu4f53; line-height: 28px; background-color: rgb(0, 0, 0);">1*1*1+2*2*2+3*3*3+......+n*n*n==(n*(n+1)/2)*(n*(n+1)/2</span></span>

<span style="font-size:32px;color:#ff0000;"><span style="font-family: 'Hiragino Sans GB W3', 'Hiragino Sans GB', Arial, Helvetica, simsun, u5b8bu4f53; line-height: 28px; background-color: rgb(0, 0, 0);">求模公式为</span></span><ol class="custom_num para-list list-paddingleft-1" style="margin: 0px 0px 14px 2em; padding: 0px; list-style: none; font-family: arial, 宋体, sans-serif; line-height: 24px;"><li class="list-num-1-3 list-num-paddingleft-1" style="margin: 0px; padding: 0px 0px 0px 21px; list-style-type: none; background-image: url(http://img.baidu.com/img/baike/editor/list/list-num-1-3.gif); background-position: 0px 6px;"><div class="para" style="margin: 0px;">(a * b) % p = (a % p * b % p) % p （3）</div></li></ol>