『算法-ACM 竞赛-CodeForces』272EDimaandHorses（假 DFS）codeforce 272E Dima and Horses （假 DFS）E. Dima and Horses Dima came to the horse land. There are n horses living in the land. Each horse in the horse land

『算法-ACM 竞赛-CodeForces』270DGreenhouseEffectCodeforce 270D Greenhouse EffectEmuskald is an avid horticulturist and owns the world’s longest greenhouse — it is effectively infinite in length. Over the ye

『算法-ACM 竞赛-CodeForces』272BDimaandSequencecodeforce 272B Dima and SequenceB. Dima and Sequence Dima got into number sequences. Now he’s got sequence a_1, _a_2, …, _a__n, consisting of n positive intege

『算法-ACM 竞赛-CodeForces』270CMagicalBoxescodeforce 270C Magical BoxesC. Magical Boxes Emuskald is a well-known illusionist. One of his trademark tricks involves a set of magical boxes. The essence of the

『算法-ACM 竞赛-CodeForces』270BMultithreadingcodeforce 270B MultithreadingB. Multithreading Emuskald is addicted to Codeforces, and keeps refreshing the main page not to miss any changes in the “recent act

『算法-ACM 竞赛-CodeForces』266cBelowtheDiagonal 矩阵变换（思维题）codeforce 266c Below the Diagonal 矩阵变换 （思维题）C. Below the Diagonal You are given a square matrix consisting of n rows and n columns. We assume that t

『算法-ACM 竞赛-CodeForces』263DCycleinGraph 搜索图论哈密尔顿环Codeforce 263D Cycle in Graph 搜索 图论 哈密尔顿环You’ve got a undirected graph G, consisting of n nodes. We will consider the nodes of the graph indexed by inte

『算法-ACM 竞赛-CodeForces』262C 贪心CodeForces - 262C 贪心Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems. There are m types of discounts. We assu

『算法-ACM 竞赛-CodeForces』262BVC9NeYAbCodeForces - 262BRoma works in a company that sells TVs. Now he has to prepare a report for the last year. Roma has got a list of the company’s incomes. The list is a

『算法-ACM 竞赛-CodeForces』262BCodeForces - 262BRoma works in a company that sells TVs. Now he has to prepare a report for the last year. Roma has got a list of the company’s incomes. The list is a sequenc