Programming VIP

Topic source Click me to enter the ACwing official website to submit Title Description Put an 8 × The chessboard of 8 is divided as follows: cut off a rectangular chessboard from the original chessboard and make the rest also rectangular, and then continue to divide the rest. After cutting (n − 1) times, there are n rectangular c ...

knapsack problem Given a group of items, each item has its own weight value. Within the limited weight, how can we choose to maximize the total value. Three kinds of backpacks 1. 01 backpack: each item can only be selected once 2. Complete backpack: there is no limit to the number of choices for each item 3. Multiple backpacks: each item ca ...

Topic & Translation Problem solution although m m m is big, but n n n is very small, so the title allows us to O ( ...

Portal: https://codeforces.com/contest/560/problem/E meaning of the title to one individual n ∗ m of Chess disc ...

[Title Description] Xiaocheng and Xiaohua are both good students who love mathematics. Recently, they have become addicted to Sudoku games. They want to compete with Sudoku. But ordinary Sudoku was too simple for them, so they asked Dr. Z for advice. Dr. Z took out his recently invented "target Sudoku" as the topic of the competit ...

Knapsack problem ★★★ (1) 0-1 knapsack problem (1 for each item) Topic introduction sample input 4 5 1 2 2 4 3 4 4 5 output 8 [version 1] two dimensional state definition of 0-1 knapsack problem f[i][j]: select only the first I items with total volume < = Max of J State analysis (1) When the current backpack capacity is insuf ...

subject Portal to CF thinking Generally speaking, we will sort intervals. Because the interval is essentially a two-dimensional partial order relationship, sorting according to the endpoint can make a dimension orderly, which is equivalent to dimension reduction. In this question, the interval is not very fixed. But of the two possible rang ...

Introduction It's very difficult. I'm aware of the gap in knowledge points again Knowledge points involved Shape pressure DP, thinking, combinatorial mathematics, DSU on Tree, line segment tree Link: 2019 Nanchang Regional subject C Give a large nonnegative integer n n ...

Xiaobian has something to say: these topics are the understanding and application of the recursive traversal structure of binary tree, which are very classic topics. After doing a few steps, you will feel that at present, you can't run away from all the problems. Recursion is just to deal with the current node - it may be to do some oper ...

mathematical problem Example: the number you can't buy Xiao Ming opened a candy store. He is ingenious: wrap the fruit candy into two kinds: a bag of 4 and a bag of 7. Candy can't be unpacked. When a child comes to buy sugar, he uses these two kinds of packaging to combine. Of course, some candies cannot be combined, such as buying 10 can ...