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
#include <iostream>
using namespace std;
int main()
{
long long sum,n;
while (cin>>n)
{
sum=0;
n%=10000;
sum=(n*(n+1)/2)*(n*(n+1)/2)%10000;
if(sum>-1&&sum<10)
cout<<"000"<<sum<<endl;
else if(sum>9&&sum<100)
cout<<"00"<<sum<<endl;
else if(sum>99&&sum<1000)
cout<<"0"<<sum<<endl;
else
cout<<sum<<endl;
}
return 0;
}