Problem Description
Calculate S(n).
S(n)=13+23 +33 +......+n3 .
S(n)=13+23 +33 +......+n3 .
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公式:S(n)=((n+1)*n/2)^2,注意输出格式#include<stdio.h> int main() { __int64 s,n; while(scanf("%I64d",&n)!=EOF) { n=n%10000; s=(((n+1)*n/2)%10000*(((n+1)*n/2)%10000)%10000); printf("%04I64d\n",s); } return 0; }