Calculate S(n)
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10014 Accepted Submission(s): 3628
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
这个题目一上手,就感觉是个卡时间复杂度的题目,而且是数学题奥!
数学公式://1^3+2^3+3^3+……+(n-1)^3+n^3=n^2(n+1)^2/4
另外附://1^2+2^2+3^2+4^2+5^2………………+n^2=n(n+1)(2n+1)/6
但是,用数学公式如果不小心(like me),肯定会wa掉N次,因为要尽量把平方那一步放到最后,才可以尽量简化运算,然后ac。
注意:格式,要用long long或者__int64否则会爆内存。
第一种:
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
__int64 n;
while(~scanf("%I64d",&n))//1^3+2^3+3^3+……+(n-1)^3+n^3=n^2(n+1)^2/4
{//1^2+2^2+3^2+4^2+5^2………………+n^2=n(n+1)(2n+1)/6
__int64 ans;
ans=n%10000;
ans=ans*(n+1)%10000;
ans/=2;
printf("%04I64d\n",ans*ans%10000);
}
return 0;
}
第二种:
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long n;
while(~scanf("%lld",&n))//1^3+2^3+3^3+……+(n-1)^3+n^3=n^2(n+1)^2/4
{//1^2+2^2+3^2+4^2+5^2………………+n^2=n(n+1)(2n+1)/6
long long ans;
ans=n%10000*(n+1)%10000/2;
ans=ans*ans%10000;
printf("%04lld\n",ans);
}
return 0;
}