Fellow me on GitHub

04 2017 档案

摘要:Ubuntu16.04安装opencv for python/c++ 网上关于opencv的安装已经有了不少资料,但是没有一篇资料能让我一次性安装成功,因此花费了大量时间去解决各种意外,希望这篇能给一些人带去便利,节省时间。 1.安装OpenCV所需的库 2.下载最新opencv源码 链接: htt 阅读全文
posted @ 2017-04-30 21:33 Penn000 阅读(7588) 评论(3) 推荐(2) 编辑
摘要:L.Happiness Chicken brother is very happy today, because he attained N pieces of biscuits whose tastes are A or B. These biscuits are put into a box. 阅读全文
posted @ 2017-04-24 12:28 Penn000 阅读(319) 评论(0) 推荐(0) 编辑
摘要:K.Deadline There are N bugs to be repaired and some engineers whose abilities are roughly equal. And an engineer can repair a bug per day. Each bug ha 阅读全文
posted @ 2017-04-24 12:26 Penn000 阅读(294) 评论(0) 推荐(0) 编辑
摘要:G. Sequence Number In Linear algebra, we have learned the definition of inversion number: Assuming A is a ordered set with n numbers ( n > 1 ) which a 阅读全文
posted @ 2017-04-24 12:23 Penn000 阅读(211) 评论(0) 推荐(0) 编辑
摘要:Problem D: GCD Description XiaoMingfoundthecomputetimeof XiaoMingfoundthecomputetimeof Input The first line is an positive integer T. ( The first line 阅读全文
posted @ 2017-04-24 12:19 Penn000 阅读(229) 评论(0) 推荐(0) 编辑
摘要:Problem A: Little Red Riding Hood Description Once upon a time, there was a little girl. Her name was Little Red Riding Hood. One day, her grandma was 阅读全文
posted @ 2017-04-24 12:16 Penn000 阅读(223) 评论(0) 推荐(0) 编辑
摘要:Phalanx Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1542 Accepted Submission(s): 757 Problem 阅读全文
posted @ 2017-04-20 22:30 Penn000 阅读(258) 评论(0) 推荐(0) 编辑
摘要:Treasure Map Your boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to many rectangular pieces, and what m 阅读全文
posted @ 2017-04-15 22:04 Penn000 阅读(192) 评论(0) 推荐(0) 编辑
摘要:Treats for the Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5801 Accepted: 3003 Description FJ has purchased N (1 <= N <= 2000) yum 阅读全文
posted @ 2017-04-06 17:27 Penn000 阅读(262) 评论(0) 推荐(0) 编辑
摘要:Help Jimmy Help Jimmy Description "Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy 阅读全文
posted @ 2017-04-06 16:53 Penn000 阅读(336) 评论(0) 推荐(0) 编辑
摘要:Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 50827 Accepted: 22574 Description A numeric sequence of ai is o 阅读全文
posted @ 2017-04-04 16:27 Penn000 阅读(205) 评论(0) 推荐(0) 编辑
摘要:Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 51319 Accepted: 21146 Description A subsequence of a given sequence is t 阅读全文
posted @ 2017-04-04 16:14 Penn000 阅读(185) 评论(0) 推荐(0) 编辑
摘要:FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15801 Accepted Submission(s): 69 阅读全文
posted @ 2017-04-04 16:00 Penn000 阅读(473) 评论(0) 推荐(0) 编辑
摘要:Tickets Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3917 Accepted Submission(s): 1968 Problem 阅读全文
posted @ 2017-04-04 13:31 Penn000 阅读(352) 评论(0) 推荐(0) 编辑
摘要:Piggy-Bank Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23646 Accepted Submission(s): 11973 Pr 阅读全文
posted @ 2017-04-04 10:59 Penn000 阅读(174) 评论(0) 推荐(0) 编辑
摘要:Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27976 Accepted Submission(s): 9 阅读全文
posted @ 2017-04-04 10:05 Penn000 阅读(277) 评论(0) 推荐(0) 编辑

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