HDOJ 2114 求和公式套用 简单数学题

Calculate S(n)

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

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

威士忌   |   We have carefully selected several similar problems for you:   2115  2113  2116  2111  2119 

#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
using namespace std;

const int mod = 10000;
long long n;
long long tmp;


int main(){
    while (cin >> n) {
         tmp = (n*(n+1)/2%mod)*(n*(n+1)/2%mod)%mod;
         printf("%04lld\n",tmp);
    }
    return 0;
}