Veritas des Liberty

摘要： K的因子中只包含2 3 5。满足条件的前10个数是：2,3,4,5,6,8,9,10,12,15。 所有这样的K组成了一个序列S，现在给出一个数n，求S中 >= 给定数的最小的数。 例如：n = 13，S中 >= 13的最小的数是15，所以输出15。 Input Output Input示例 Out 阅读全文

摘要： 将一堆正整数分为2组，要求2组的和相差最小。 例如：1 2 3 4 5，将1 2 4分为1组，3 5分为1组，两组和相差1，是所有方案中相差最少的。 Input Output Input示例 Output示例 分成两组当两组的数据都趋向于算术平均值的时候此时的差值最小，res来表示一个背包，背包的空 阅读全文

摘要： 1.DOM access with jQuery The jQuery function can be named $ or jQuery 2.DOM modification with jQuery 3.jQuery collections & looping jQuery collections 阅读全文

摘要： Modifying an existing element Modifying an existing element Modifying an existing element Modifying an existing element We covered various ways that y 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 题目链接 题意：给出n个数，求加和大于x的最短区间的区间长度。 如果前i个数字和为y，那么如果前j数字的和小于等于y-x，那么i-j就是一种可能的情况，我们对于所有的i找出前面最大的j就可以了，因为数据量比较大，用树状数组来处理前n项的最大值，但是每个数字又可能比较大，所以先离散化处理一下。 AC代 阅读全文