We are writing a program to calculate the number of paths it takes to take any number, n, to get to the end result of 1. We will be doing this C++ for our CS W378 collatz project assignment.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001308s ]
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.088814s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001280s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002102s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001260s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003668s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001087s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003259s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015158s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001481s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 65415 [ RunTime:0.003636s ]
