As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
这是一道提交答案题。
这是一道咋克在 IOI 2024 训练中大战了半个小时的题。
有一个矩形，被划分成了$n \times n$的格子，你要将其中涂黑其中一些格子，要求
问最多能涂黑多少格子。
你不需要提交程序，你只需要提交你构造的答案。
本题共有 $7$ 个测试点，每个测试点 $1$ 分，共 $7$ 分。
一个整数 $n$。
$n$ 行，每行长度为 $n$ 的 $01$ 串，$1$ 表示涂黑，$0$ 表示未涂黑。
5
10101 00000 10101 00000 10101
一共$7$个点，保证$n$依次等于$300,301,302,303,304,305,306$。
对于每个$n$，假设最优解黑色个数为$a_n$，你的答案为$b_n$。
$b_n=a_n$，你将获得$1$分。否则你获得 $0$ 分。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: