hdu 2114

Calculate S(n)

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

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

天邪

 

Source

HDU 2007-10 Programming Contest_WarmUp

 

Recommend

威士忌

 

//n项立法和公式：1^3 + 2^3 + …… n^3 = [n (n+1） / 2]^2=（1+2+……+n)^2 
//另外输出注意格式
#include <stdio.h>
int main()
{
	__int64 n;
	while(~scanf("%I64d", &n))
	{
		printf("%04I64d\n", (n*(n+1)/2%10000) * (n*(n+1)/2%10000) % 10000);
	}
	return 0;
}