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 3+2 3 +3 3 +......+n 3 .
S(n)=1 3+2 3 +3 3 +......+n 3 .
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
同余基本性质: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;
}