Calculate S(n)

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 #include <stdio.h>   // 运用数学公式：1^3 +2^3 +3^3 +……+n^3 =[n(n+1)/2]^2
 2 
 3 int main(){
 4     int n;
 5     int result;
 6 
 7     while(scanf("%d",&n)!=EOF){    
 8         n=n%10000;
 9         result=(n*(n+1)/2)%10000;
10         result=(result*result)%10000;
11         
12         printf("%04d\n",result);
13     }
14     
15     return 0;
16 }

 

 

转载于:https://www.cnblogs.com/zqxLonely/p/4059794.html