HDU 2114 Calculate S(n)(公式)

Calculate S(n)

Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 9640    Accepted Submission(s): 3492

 

 

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

 

 

//1~N的立方和公式为S(N) = 1^3 + 2^3 + 3^3 + … + N^3 = N^2*(N+1)^2/4
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    long long n;
    long long sum;
    while(cin>>n){
        n%=10000;
        sum=(n*n)*(n+1)*(n+1)/4;
        sum%=10000;
        printf("%04lld\n",sum);
    }
    return 0;
}