『算法-ACM 竞赛-POJ』 1905 Expanding Rods（二分） Expanding RodsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20224 Accepted: 5412Description When a thin rod of length L is heated n degrees, it expa

『算法-ACM 竞赛-POJ』 1845-Sumdiv（厉害了这个题）Description Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).In

『算法-ACM 竞赛-POJ』 1505 Copying BooksCopying BooksTime Limit: 3000MS Memory Limit: 10000KTotal Submissions: 10819 Accepted: 3349Description Before the invention of book-printing, it was very hard to make

『算法-ACM 竞赛-POJ』 1170 Shopping Offers 非状态压缩做法 Shopping Offers Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5659 Accepted: 2361 Description In a shop each kind of product has a price. Fo

『算法-ACM 竞赛-POJ』 1176 Party Lamps&& USACO 2.2 派对灯（搜索）题目地址 http://poj.org/problem?id=1176题目描述在 IOI98 的节日宴会上，我们有 N(10<=N<=100)盏彩色灯，他们分别从 1 到 N 被标上号码。 这些灯都连接到四个按钮： 按钮 1：当按下此按钮，将改变所

『算法-ACM 竞赛-DFS』POJ 1190 生日蛋糕Description7 月 17 日是 Mr.W 的生日，ACM-THU 为此要制作一个体积为 Nπ 的 M 层生日蛋糕，每层都是一个圆柱体。设从下往上数第 i(1 <= i <= M)层蛋糕是半径为 Ri, 高度为 Hi 的圆柱。当 i < M 时，要求 Ri > Ri+1 且 Hi >

『算法-ACM 竞赛-Codeforces』『ACM 算法-思维题』– CodeForces -CodeForces - 992C Nastya and a Wardrobe（欧拉降幂+快速幂）Nastya received a gift on New Year — a magic wardrobe. It is magic because in the end of each month the

『算法-ACM 竞赛-CodeForces』Round 623(Div. 2,based on VK Cup 2019-2020 - Elimination Round,Engine)D. RecommendationsVK news recommendation system daily selects interesting publications of one of n disjoint

『算法-ACM 竞赛-CodeForces』Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) C. RestoringC. Restoring Permutationtime limit per test1 secondmemory limit per test256 megabytesinputs

『算法-ACM 竞赛-CodeForces』Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) B. HomecomingAfter a long party Petya decided to return home, but he turned out to be at the opposite e