TOKHE的专栏

多柱汉诺塔最优算法设计探究 引言汉诺塔算法一直是算法设计科目的最具代表性的研究问题，本文关注于如何设计多柱汉诺塔最优算法的探究。最简单的汉诺塔是三个柱子（A、B、C），因此多柱汉诺塔的柱子个数M≥3。下面从三柱汉诺塔说起，慢慢深入我们要关心的问题。1. 三柱汉诺塔三柱汉诺塔是经典的汉诺塔问题，在算法设计中是递归算法的典型问题。其算法是这样的: 首先把A 柱上面的n- 1 个

进制转换Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23830    Accepted Submission(s): 13344Problem Description输入一个十进制数N，将它转换成R进制数

Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18258 Accepted: 9208DescriptionCurrent work in cryptography involves (among oth

计算最长连续相同字符的个数

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 39397 Accepted: 14204DescriptionIn this problem, you have to analyze a particular sorti

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

ACfunTime Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionAs a former ACMer, "AC" is a special abbreviated wor

http://115.28.76.232/problem?pid=1096

题目链接：http://acdreamoj.sinaapp.com/说实话这道题很坑。。

数字整除Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 72, Accepted users: 66Problem 10932 : No special judgementProblem description

find the nth digitTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8351    Accepted Submission(s): 2381Problem Description假设：S1

EncodingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25691    Accepted Submission(s): 11289Problem DescriptionGiven a string

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29241 Accepted: 10027DescriptionBackground The knight is getting bored of seeing t

#includeint main(){ int a,b,c; int d,e,f; int m,n,t,s,h,k,l; scanf("%d",&t); while(t--) { scanf("%d:%d:%d %d:%d:%d",&a,&b,&c,&d,&e,&f); if(d>11) d

http://acm.hdu.edu.cn/showproblem.php?pid=1678ShopaholicTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1590    Accepted Submission(s)

A + B Problem IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 204863    Accepted Submission(s): 39378Problem DescriptionI have

Longest Ordered SubsequenceLongest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 31680 Accepted: 13848DescriptionA nu

Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 71138    Accepted Submission(s): 26463Problem DescriptionCon

A. DZY Loves Chessboardtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves chessboard, and he enjoys

Who's in the MiddleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31015 Accepted: 17991DescriptionFJ is surveying his herd to find the most average c

B. Football Kittime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputConsider a football tournament where n teams

A. Choosing Teamstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Saratov State University Olympiad Prog

ElevatorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42155    Accepted Submission(s): 23093Problem DescriptionThe highest bui

亲和数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20775    Accepted Submission(s): 12590Problem Description古希腊数学家毕达哥拉斯在自然数研究中

IP判断Time Limit:10000MS  Memory Limit:65536KTotal Submit:169 Accepted:66Description在基于Internet的程序中，我们常常需要判断一个IP字符串的合法性。 合法的IP是这样的形式： A.B.C.D 其中A、B、C、D均为位于[0, 255]中的整数。为了简单起见，我们规定这四个整数中不允许