04 2016 档案

Longest Increasing Subsequence Review
摘要：Longest Increasing Subsequence (O(n^2), O(nlgn)) 阅读全文
posted @ 2016-04-30 20:42 william-cheung 阅读(176) 评论(0) 推荐(0) 编辑
IOCCC 1987 最佳单行代码解读
摘要：/* ioccc.c */ /* IOCCC best one-liner winner 1987 by David Korn --- main() { printf(&unix["\021%six\012\0"],(unix)["have"]+"fun"-0x60);} from */ /* A detailed set of samples to show how this wor... 阅读全文
posted @ 2016-04-09 10:55 william-cheung 阅读(677) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示