qeatzy

摘要： for the backtracking part, thanks to the video of stanford cs106b lecture 10 by Julie Zelenski for the nice explanation of recursion and backt... 阅读全文

摘要： use sentinel to avoid boudary testing, use swap trick to avoid extra copy. original version#include #include int main() { //freopen("input... 阅读全文

摘要： huffman coding, greedy algorithm. std::priority_queue, std::partition, when i use the three commented lines, excution time increase to 15ms f... 阅读全文

摘要： thanks to http://acm.hdu.edu.cn/discuss/problem/post/reply.php?action=support&postid=19638&messageid=1&deep=0 for the test case provided. belo... 阅读全文

摘要： the 2 version are essentially the same, except version 2 search from the larger end, which reduce the search time in extreme condition from l... 阅读全文

摘要： errors, clauses in place, logical ones, should be avoided.#include #include #include int main() { //freopen("input.txt","r",stdin); cons... 阅读全文

摘要： errors made, boundary conditions, #include char* sum(char *to, char *from) { static const int charzero='0',oublecharzero='0'+'0'; int s... 阅读全文

摘要： a problem where OO seems more natural to me, implementing a utility class not instantiable. how to prevent instantiation, thanks to http://st... 阅读全文

摘要： (string process, fgets, scanf, neat utilization of switch clause) simple problem, simple code.#include #include #define MAXLEN 22char password... 阅读全文

摘要： thanks to http://stackoverflow.com/questions/2144459/using-scanf-to-accept-user-input and http://stackoverflow.com/questions/456303/how-to-v... 阅读全文