11 2015 档案

摘要:传送门 Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15305 Accepted Submission(s): 阅读全文
posted @ 2015-11-29 00:04 Pat 阅读(196) 评论(0) 推荐(0) 编辑
摘要:传送门The Enterprise has encountered a planet that at one point had been inhabited. The only remnant from the prior civilization is a set of texts that w... 阅读全文
posted @ 2015-11-28 01:01 Pat 阅读(211) 评论(0) 推荐(0) 编辑
摘要:下述快捷键都是我写C++代码时发现的,是否适用其他格式(扩展名)的文件尚为未知。 Basic Editing Ctrl + A 全选 Ctrl + S 保存 Ctrl + C 复制 Ctrl + V 粘贴 Ctrl + L 选中一行 (Select lines - Repeat to select 阅读全文
posted @ 2015-11-27 23:34 Pat 阅读(383) 评论(0) 推荐(0) 编辑
摘要:(这篇随笔是 C++ Primer 5th ed. pp.39-40的摘录)Some characters, such as backspace or control characters, have no visible image. Such characters are non printab... 阅读全文
posted @ 2015-11-27 00:02 Pat 阅读(301) 评论(0) 推荐(0) 编辑
摘要:传送门Solution:KM算法关于KM算法有一篇极好的文档http://www.cse.ust.hk/~golin/COMP572/Notes/Matching.pdfImplementation:#include #include #include #include using namespac... 阅读全文
posted @ 2015-11-22 21:22 Pat 阅读(242) 评论(0) 推荐(0) 编辑
摘要:随机增量算法(a randomized incremental algorithm)#define sqr(x) ((x)*(x))#define EPS 1e-4struct P{ double x, y; P(double x, double y):x(x),y(y){} P(... 阅读全文
posted @ 2015-11-18 20:57 Pat 阅读(408) 评论(0) 推荐(0) 编辑
摘要:example POJ 2229 Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KDescriptionIn this problem, you have to analyze a particular sorting algorith... 阅读全文
posted @ 2015-11-09 12:12 Pat 阅读(408) 评论(0) 推荐(0) 编辑
摘要:getchar()和scanf("%c")的功能都是从STDIN读一个字符,单论功能两者没有区别。但两者的返回值是有区别的:------------------------------------------------scanf()的详尽介绍请移步这里。----------------------... 阅读全文
posted @ 2015-11-07 19:40 Pat 阅读(1200) 评论(0) 推荐(0) 编辑
摘要:传送门 Time Limit: 2000MS Memory Limit: 65536K Description Farmer John is an astounding accounting wizard and has realized he might run out of money to r 阅读全文
posted @ 2015-11-05 14:39 Pat 阅读(206) 评论(0) 推荐(0) 编辑

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