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): 1897    Accepted Submission(s): 713

Problem DescriptionCalculate S(n).

S(n)=13
+23
+33
+......+n3
. 

 

InputEach line will contain one integer N(1 < n < 1000000000). Process to end of file. 

 

OutputFor each case, output the last four dights of S(N) in one line. 

 

Sample Input

1
2

 

 

Sample Output

0001
0009

解題：

       運用數學公式：13
+23
+33
+……+n3
=[n(n+1)/2]2

#include <iostream><br />#include <iomanip><br />using namespace std;<br />int main()<br />{<br />__int64 sum,n;<br />while (cin>>n)<br />{<br />sum=0;<br />n%=10000;<br />sum=(n*(n+1)/2)*(n*(n+1)/2)%10000;<br />cout<<setfill('0')<<setw(4)<<sum<<endl;<br />}<br /> return 0;<br />}