自定义博客皮肤VIP专享

*博客头图：

点击选择上传的图片

格式为PNG、JPG，宽度*高度大于1920*100像素，不超过2MB，主视觉建议放在右侧，请参照线上博客头图

请上传大于1920*100像素的图片！

博客底图：

点击选择上传的图片

图片格式为PNG、JPG，不超过1MB，可上下左右平铺至整个背景

栏目图：

点击选择上传的图片

图片格式为PNG、JPG，图片宽度*高度为300*38像素，不超过0.5MB

主标题颜色：

RGB颜色，例如：#AFAFAF

Hover：

RGB颜色，例如：#AFAFAF

副标题颜色：

RGB颜色，例如：#AFAFAF

预览取消提交

自定义博客皮肤

上一步保存

Kaipeng Liu's Column

BEYOND REDEMPTION

liukaipeng

博客等级

码龄19年

69
原创

2
点赞

0
收藏

29
粉丝

关注

私信

分类专栏

Algorithm 57篇
Intern
iPhone 1篇
Linux 1篇
Misc
Myself
Networking 1篇
Rubiks 2篇

最新评论

UVa Problem Solution: 10247 - Complete Tree Labeling
DarkHelmet86: to answer academus_: a quick google search for big_unsigned.hpp brought this up: http://blog.csdn.net/liukaipeng/article/details/3433002 However compiling this code with it is giving me a floating point fault. Perhaps I am missing some necessary compiler flags?
UVa Problem Solution: 10247 - Complete Tree Labeling
DarkHelmet86: I am trying to implement this solution in Java but something's not right: public static BigInteger factorial(int n) { BigInteger total = BigInteger.ONE; for(int i = 1; i <= n; ++i) { total = total.multiply(BigInteger.valueOf(i)); } return total; } public static int countNodes(int k, int d) { if(d == 0 || k == 1) { return d+1; } return (int)((Math.pow(k, d+1)-1)/(k-1)); // k^(d+1) / (k-1) } public static void main(String[] args) { for(int k = 1; k <= 21; ++k) { soln[k][0] = BigInteger.ONE; for(int d = 1; d <= 21; ++d) { if(k*d <= 21) { BigInteger numerator = factorial(countNodes(k, d)-1).multiply(soln[k][d-1]); BigInteger denominator = factorial(countNodes(k, d-1)).pow(k); soln[k][d] = numerator.divide(denominator); } } } while(sc.hasNext()) { int k = sc.nextInt(); int d = sc.nextInt(); System.out.println(soln[k][d]); } }
UVa Problem Solution: 10139 - Factovisors
academus_: 你这段代码在http://uva.onlinejudge.org/和http://www.programming-challenges.com/都不能通过
UVa Problem Solution: 10247 - Complete Tree Labeling
academus_: Please, where's the "big_unsigned.hpp"?
UVa Problem Solution: 10183 - How many fibs?
atopoxo: dontzhuangb 讲话太重了吧，这个代码风格还好吧。

Networking

关注

关注数：文章数：1 文章阅读量：807 文章收藏量：0

作者: liukaipeng

对解决挑战性的问题充满激情具有很强的学习能力富于创新精神喜欢在与他人的合作中完善自我，达成目标工作极具负责心及自信心待人诚恳，为人正直

展开

专栏收录文章

Monitoring Clusters With SNMP

MONITORING theperformance of hosts in your cluster is somewhat a boring task. Iveseen various programs written to access system usage informations withhandmade methods, such as filtering output

原创 2008-10-23 16:44:00 · 807 阅读 · 0 评论

Networking

作者: liukaipeng

Monitoring Clusters With SNMP