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): 7584    Accepted Submission(s): 2784

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

12

 

Sample Output

00010009

 

前n项和的立方公式为   ： s(n)=（n*(n+1)/2）^2;

同余基本性质：a*b≡(a%m)*(b%m)（mod m）

输出技巧

#include<stdio.h>int main( ){    __int64 ans,n;    while(scanf("%I64d",&n)!=EOF)    {        ans=((n*(n+1)/2)%10000)*((n*(n+1)/2)%10000)%10000;        printf("%04I64d\n",ans);    }    return 0;}