摘要：
Problem Description n soldiers are dispatched to somewhere in Byteland. These soldiers are going to set off now, but the target... 阅读全文
摘要：
Problem Description You are given three positive integers N,x,y. Please calculate how many permutations of 1∼N satisfies the fo... 阅读全文
摘要：
Problem Description String matching is a common type of problem in computer science. One string matching problem is as followin... 阅读全文
摘要：
Problem Description A sequence of length n is called a permutation if and only if it's composed of the first n positive integer... 阅读全文
摘要：
Problem Description In a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative... 阅读全文
摘要：
【概述】 分数规划的一般形式为： 特别的，当 时，称为 01 分数规划 简单来说，就是有一些二元组 (a[i],b[i])，现在从中选择某些二元组，使得 最大或最小 这一类题通用的解法是利用二分法来解决： 假设 x 为最优解，对应的最优函数值为 λ，那么有... 阅读全文
摘要：
Problem Description Many problems require printing the probability of something. Moreover, it is common that if the answer is a... 阅读全文
摘要：
Problem Description You are given a positive integer n > 1. Consider all the different prime divisors of n. Each of them is inc... 阅读全文
摘要：
Problem Description You are given a 4 × 4 grid, which consists of 15 number cells and an empty cell. All numbers are unique and... 阅读全文
摘要：
Problem Description There are n stones numbered from 1 to n. The weight of the i-th stone is i kilograms. We divide the stones ... 阅读全文