摘要：
展开 题目描述 在一个 n*n个方格的国际象棋棋盘上，马（骑士）可以攻击的棋盘方格如图所示。棋盘上某些方格设置了障碍，骑士不得进入 对于给定的 n*n 个方格的国际象棋棋盘和障碍标志，计算棋盘上最多可以放置多少个骑士，使得它们彼此互不攻击 输入格式 第一行有 2 个正整数n 和 m (1<=n<=2 阅读全文
posted @ 2019-10-05 23:27
pengge666
阅读(186)
评论(0)
推荐(0)
摘要：
Problem DescriptionIn the second year of the university somebody started a study on the romantic relations between the students. The relation "romanti 阅读全文
posted @ 2019-10-05 22:23
pengge666
阅读(224)
评论(0)
推荐(0)
摘要：
Problem DescriptionFrank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid 阅读全文
posted @ 2019-10-05 20:33
pengge666
阅读(135)
评论(0)
推荐(0)
摘要：
Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he h 阅读全文
posted @ 2019-10-05 12:41
pengge666
阅读(151)
评论(0)
推荐(0)
摘要：
Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids 阅读全文
posted @ 2019-10-05 12:14
pengge666
阅读(209)
评论(0)
推荐(0)
浙公网安备 33010602011771号