![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces
AndreaQ
除非宇宙爆炸,地球毁灭,战争爆发,而你时日无多,否则,一切还来得及!
展开
-
A - The least round way
There is a square matrixn × n, consisting of non-negative integer numbers. You should find such a way on it that starts in the upper left cell of the matrix; each following cell is to the right or down from the current cell; the way ends in the bottom .原创 2020-12-02 11:25:33 · 75 阅读 · 0 评论 -
codeforces Vanya and Lanterns
Vanya and Lanterns Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the原创 2015-01-09 21:53:30 · 748 阅读 · 0 评论 -
codeforces Vasya and Basketball
Description Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 point原创 2015-01-11 19:55:33 · 772 阅读 · 0 评论 -
分治练习之Ultra-QuickSort
Ultra-QuickSort Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence eleme原创 2015-01-09 21:13:26 · 824 阅读 · 1 评论