摘要：描述 Given an N x N square grid (2 <= N <= 15) and each grid has some beans in it. You want to write at most K (1 <= K <= 2N - 2) horizontal or vertical 阅读全文

摘要：描述 FJ now is a postman of a small town in the hills. The town can be represented by a N×N matrix. Each field is represented with:-'K' character: a hou 阅读全文