QOJ.ac

QOJ

时间限制: 1 s 内存限制: 512 MB 总分: 100 难度: [显示]

#1806. 字元網格

统计

這是一個輸出題(output-only problem)。

你的任務是建立一個邊長為 $N \ge 13$ 的正方形網格,並填入小寫英文字母,使得下列性質成立。

令 $c_{i,j}$ 表示第 $i$ 列第 $j$ 行的字元。

考慮 $N^2 \cdot (N - 1) / 2$ 個形式為 $A_{i,j,p} = c_{i,j}c_{i,j+1} \dots c_{i,j+p}$ 的字串,其中 $1 \le i \le N$ 且對於每個 $1 \le j, p \le N - 1$ 滿足 $j + p \le N$。

同時考慮 $N^2 \cdot (N - 1) / 2$ 個形式為 $B_{i,j,p} = c_{i,j}c_{i+1,j} \dots c_{i+p,j}$ 的字串,其中 $1 \le j \le N$ 且對於每個 $1 \le i, p \le N - 1$ 滿足 $i + p \le N$。

所有這 $N^2 \cdot (N - 1)$ 個字串必須兩兩相異。

請依照下列格式輸出答案:首先輸出 $N$ ($13 \le N \le 100$)。接著輸出該正方形網格,共 $N$ 行;第 $i$ 行應包含一個長度為 $N$ 的字串,代表網格的第 $i$ 列。

若有多個正確解,輸出其中任何一個皆可。

範例

範例輸出 1

4
petr
ozav
odsk
camp

說明

對於範例中的答案,雖然網格性質成立,但網格大小太小,不符合題目要求的解。

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.