hdu 2114

Calculate S(n)

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

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
   
   
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
	long long n,sum;
	while(scanf("%I64d",&n)!=EOF)
	{
	  sum=(n*n%40000)*((n+1)*(n+1)%40000)%40000; 
		printf("%04I64d\n",sum/=4); 
	} 
	return 0;
}
   
   
2
  
  

 

Sample Output

  
  

   
   0001
0009
  
  
  
  

   
   公式：