HDU 2114 数学题

Calculate S(n)

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

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
  
  
  
  

   
   1^3+2^3....=(n*(n+1)/2)^2
  
  
  
  

   
   #include<cstdio>
#include<iostream>
using namespace std;
int main()
{

   
   	long long n=0;

   
   	while(scanf("%lld",&n)!=EOF)

   
   	{

   
   		long long sum=0;

   
   		if(n%2)

   
   		{

   
   			sum=(((n+1)/2)%10000)*n%10000;

   
   		}

   
   		else

   
   		{

   
   			sum=(((n)/2)%10000)*(n+1)%10000;

   
   		}

   
   		long long ans=sum*sum%10000;

   
   		sum=ans;

   
   		int k=0;

   
   		while(sum)

   
   		{

   
   			k++;

   
   			sum/=10;

   
   		}

   
   		for(int i=1;i<=4-k;i++)

   
   		 printf("0");

   
   		if(ans!=0)

   
   		printf("%lld\n",ans);

   
   	    else

   
   	     printf("\n");

   
   	}

   
   	return 0;
}