![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
atcoder
王文波~
清。。
展开
-
atcoder
Problem Statement A maze is composed of a grid of H × W squares - H vertical, W horizontal. The square at the i -th row from the top and the j -th column from the left - ( i , j ) is a wall if S i j is # and a road if S i j is … There is a magician in (原创 2020-08-22 22:44:42 · 189 阅读 · 0 评论 -
atcoder--------174
Problem Statement We have N logs of lengths A 1 , A 2 , ⋯ A N . We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t ( 0 < t < L ) , it becomes two logs of lengths t and L原创 2020-08-03 11:23:50 · 370 阅读 · 0 评论