『算法-ACM 竞赛-CodeForces』Round #460 (Div. 2)-A Supermaket(贪心） A. Supermarket time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output

『算法-ACM 竞赛-CodeForces』Ozon Tech Challenge 2020-D. Kuroni and the Celebration（交互题+DFS)After getting AC after 13 Time Limit Exceeded verdicts on a geometry problem, Kuroni went to an Italian restaurant

『算法-ACM 竞赛-CodeForces』Ozon Tech Challenge 2020-C. Kuroni and Impossible Calculation(鸽笼原理）To become the king of Codeforces, Kuroni has to solve the following problem. He is given n numbers a1,a2,…,an.

『算法-ACM 竞赛-CodeForces』Ozon Tech Challenge 2020-B. Kuroni and Simple Strings（贪心）B. Kuroni and Simple Stringstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandar

『算法-ACM 竞赛-CodeForces』Ozon Tech Challenge 2020-A. Kuroni and the Giftsthe i-th necklace has a brightness ai, where all the ai are pairwise distinct (i.e. all ai are different),the i-th bracelet has a

『算法-ACM 竞赛-CodeForces』CodeCraft-20 (Div. 2)-C. Primitive Primes（本原多项式+数学推导）It is Professor R’s last class of his teaching career. Every time Professor R taught a class, he gave a special problem for t

『算法-ACM 竞赛-CodeForces』CodeCraft-20 (Div. 2)-B. String Modification (找规律+模拟）Vasya has a string s of length n. He decides to make the following modification to the string: Pick an integer k, (1≤k≤n).For

『算法-ACM 竞赛-CodeForces』CodeCraft-20 (Div. 2)-A. Grade Allocationn students are taking an exam. The highest possible score at this exam is m. Let ai be the score of the i-th student. You have access to

『算法-ACM 竞赛-CodeForces』CodeCraft-20 (Div. 2) D. Nash Matrix 详解（DFS 构造）D. Nash Matrixtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNash designed a

『算法-ACM 竞赛-CodeForces』322ECieltheCommander（点分治）Codeforce 322E Ciel the Commander （点分治）E. Ciel the Commander Now Fox Ciel becomes a commander of Tree Land. Tree Land, like its name said, has n cities c