HDU 2114 Calculate S(n)(立方阶求和公式)

网友投稿 825 2022-08-23

HDU 2114 Calculate S(n)(立方阶求和公式)

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): 10063    Accepted Submission(s): 3643

Problem Description

Calculate S(n). 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

Author

天邪

Source

​​HDU 2007-10 Programming Contest_WarmUp ​​

题解:数学公式:1^3+2^3+3^3+....n^3=[n(n+1)/2]^2

AC代码:

#include#include#include#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL;using namespace std;//数学公式:1^3+2^3+3^3+....n^3=[n(n+1)/2]^2 int main(){ LL n,s; while(~scanf("%lld",&n)) { s=(n*(n+1)/2%10000)*(n*(n+1)/2%10000)%10000; printf("%04lld\n",s); } return 0;}

版权声明:本文内容由网络用户投稿,版权归原作者所有,本站不拥有其著作权,亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容,请联系我们jiasou666@gmail.com 处理,核实后本网站将在24小时内删除侵权内容。

上一篇:HDU 5747 BestCoder Round #84 Aaronson (模拟)
下一篇:svn常用命令整理(svn命令行)
相关文章

 发表评论

暂时没有评论,来抢沙发吧~