- 博客(2)
- 资源 (6)
- 收藏
- 关注
转载 HDU-1098-Ignatius's puzzle
f(x+1)=5*(x+1)^13+13*(x+1)^5+k*a*(x+1) ; 用二项式定理展开f(x+1)=5*( C(13,0)+C(13,1)*x+……+C(13,13)*x^13 ) + 13*( C(5,0)+C(5,1)*x+……+C5,5)*x^5 ) + k*a*(x+1) 可以得到 f(x+1)=f(x)+5*( C(13,0)+C(13,1)*x+……+C(13,12)*
2014-03-24 20:18:26 548
原创 HDOJ-1228-A+B
#include #include #include using namespace std; char num[11][10]={"zero","one","two","three","four","five","six","seven","eight","nine"}; int search(char ch[]) { int i; for(i=0;i
2014-03-19 20:59:52 499
VisualBasicPowerPacks10.0
2017-02-22
64位python2.7模块scipy.exe可直接安装
2016-04-28
64位pathon2.7模块numpy+scipy+matplotlib+pyparsing+setuptools+dateutil+six
2016-04-28
64位python2.7模块numpy+scipy+matplotlib+pyparsing+setuptools+dateutil+six
2016-04-25
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人