本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve
the Joseph link problem: Establishes to circulate Shan Lianbiao,
assigns the point according to the smooth search, after found deletes,
finally prints the serial number sequence which deletes.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001972s ]
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.107797s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001237s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001477s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001186s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005173s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001085s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004440s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016019s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001222s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 115522 [ RunTime:0.013548s ]
