04 2018 档案

摘要:Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less 阅读全文 »
posted @ 2018-04-22 17:27 Veritas_des_Liberty 阅读(287) 评论(0) 推荐(0) 编辑
摘要:ZB loves watching RunningMan! There's a game in RunningMan called 100 vs 100. There are two teams, each of many people. There are 3 rounds of fighting 阅读全文 »
posted @ 2018-04-22 16:51 Veritas_des_Liberty 阅读(172) 评论(0) 推荐(0) 编辑
摘要:Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize 阅读全文 »
posted @ 2018-04-21 22:15 Veritas_des_Liberty 阅读(185) 评论(0) 推荐(0) 编辑
摘要:As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: Yuta ha 阅读全文 »
posted @ 2018-04-21 21:10 Veritas_des_Liberty 阅读(279) 评论(0) 推荐(0) 编辑
摘要:The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either fil 阅读全文 »
posted @ 2018-04-19 21:48 Veritas_des_Liberty 阅读(197) 评论(0) 推荐(0) 编辑
摘要:题目链接 题意:给出n个数,求加和大于x的最短区间的区间长度。 如果前i个数字和为y,那么如果前j数字的和小于等于y-x,那么i-j就是一种可能的情况,我们对于所有的i找出前面最大的j就可以了,因为数据量比较大,用树状数组来处理前n项的最大值,但是每个数字又可能比较大,所以先离散化处理一下。 AC代 阅读全文 »
posted @ 2018-04-13 22:20 Veritas_des_Liberty 阅读(274) 评论(0) 推荐(0) 编辑
摘要:In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers: In this problem, you are given n, you have to fi 阅读全文 »
posted @ 2018-04-13 21:45 Veritas_des_Liberty 阅读(499) 评论(0) 推荐(0) 编辑
摘要:In this problem, you are given an integer number s. You can transform any integer number A to another integer number B by adding x to A. This x is an 阅读全文 »
posted @ 2018-04-11 22:04 Veritas_des_Liberty 阅读(279) 评论(0) 推荐(0) 编辑
摘要:The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could f 阅读全文 »
posted @ 2018-04-10 21:47 Veritas_des_Liberty 阅读(224) 评论(0) 推荐(0) 编辑
摘要:原文链接 There are many trees forming a m * n grid, the grid starts from (1,1). Farmer Sherlock is standing at (0,0) point. He wonders how many trees he c 阅读全文 »
posted @ 2018-04-07 22:25 Veritas_des_Liberty 阅读(189) 评论(0) 推荐(0) 编辑
摘要:Relatives Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15708 Accepted: 7966 Description Given n, a positive integer, how many positive i 阅读全文 »
posted @ 2018-04-07 22:00 Veritas_des_Liberty 阅读(332) 评论(0) 推荐(0) 编辑
摘要:Co-prime Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6425 Accepted Submission(s): 2569 Proble 阅读全文 »
posted @ 2018-04-05 22:24 Veritas_des_Liberty 阅读(555) 评论(0) 推荐(0) 编辑
摘要:明码 汉字的字形存在于字库中,即便在今天,16点阵的字库也仍然使用广泛。 16点阵的字库把每个汉字看成是16x16个像素信息。并把这些信息记录在字节中。 一个字节可以存储8位信息,用32个字节就可以存一个汉字的字形了。 把每个字节转为2进制表示,1表示墨迹,0表示底色。每行2个字节, 一共16行,布 阅读全文 »
posted @ 2018-04-05 22:04 Veritas_des_Liberty 阅读(1021) 评论(0) 推荐(1) 编辑
摘要:Smith Numbers Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14173 Accepted: 4838 Description While skimming his phone directory in 1982, 阅读全文 »
posted @ 2018-04-05 21:09 Veritas_des_Liberty 阅读(248) 评论(0) 推荐(0) 编辑
摘要:Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how 阅读全文 »
posted @ 2018-04-04 22:00 Veritas_des_Liberty 阅读(256) 评论(0) 推荐(0) 编辑
摘要:The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not nece 阅读全文 »
posted @ 2018-04-04 21:20 Veritas_des_Liberty 阅读(276) 评论(0) 推荐(0) 编辑

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