本程序通过用递归调用的方法实现了汉诺塔问题,这是一个通用的程序,通过输入的层数结果输入到一个out.txt的文件中-This procedure by using the method of recursive calls a Tower of Hanoi problem, which is a common procedure, the results by entering into the layers of a document out.txt
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001302s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.089992s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001214s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001904s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001207s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003729s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001052s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003205s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014611s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001309s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 235847 [ RunTime:0.001338s ]
