无矩形网格 - Problema

#12657. 无矩形网格

Estadísticas

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

构造一个 $N \times N$ 的网格，满足以下条件：

$2 \le N \le 150$
每个单元格填充为 'O' 或 '.'。
至少有 1700 个单元格填充为 'O'。
对于任意四个整数 $i, j, k, l$，满足 $1 \le i < j \le N$ 且 $1 \le k < l \le N$，四个单元格 $(i, k), (i, l), (j, k), (j, l)$ 中至少有一个填充为 '.'。

输入格式

没有输入。

输出格式

第一行包含一个整数 $N$。接下来的 $N$ 行，每行包含 $N$ 个字符（'O' 或 '.'），这些行描述了该网格。

样例

输入格式 1

(无)

输出格式 1

5
.....
.....
..OOO
...O.
..O..

说明

该样例的输出满足除第三个条件（网格中 'O' 的数量）以外的所有条件。

Discussions

About Discussions

The discussion section is only for posting: 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.

Open Discussions 0

No discussions in this category.

Issues

About Issues

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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0