TOKHE的专栏

http://acm.hdu.edu.cn/showproblem.php?pid=2512一卡通大冒险Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1295    Accepted Submission(s)

http://acm.hdu.edu.cn/showproblem.php?pid=1207思路是借鉴网上一大牛的，写的很完美了，所以一句没改，代码是自己敲的.变体汉诺塔    问题描述：在经典汉诺塔的基础上加一个条件，即，如果再加一根柱子（即现在有四根柱子a,b,c,d)，计算将n个盘从第一根柱子(a)全部移到最后一根柱子(d)上所需的最少步数，当然，也不能够出现大的盘子放在小的

http://acm.hdu.edu.cn/showproblem.php?pid=1555

http://acm.hdu.edu.cn/showproblem.php?pid=1143Tri TilingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1992    Accepted Submission(s)

TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7452 Accepted: 3639DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?

SumTime Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionYou are given an N*N digit matrix and you can get seve