奎尔萨拉斯 - 题目

#4595. 奎尔萨拉斯

统计

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

Kael’thas 有一个魔法方阵，其中包含了二维平面上所有坐标为 $[0, n]$ 范围内整数的点。

他可以在平面上画几条直线（火线）。每条直线会覆盖其上的所有点。注意，这些直线没有端点，且向两个方向无限延伸。

此外有一条特殊规则：他不能画覆盖点 $(0, 0)$ 的直线，因为他的王座位于 $(0, 0)$。

请问他最少需要画多少条直线，才能覆盖魔法方阵中除 $(0, 0)$ 以外的所有点？

样例

输入格式 1

1
2

输出格式 1

说明

样例的一种可能答案是：$x = 1, x = 2, y = 1, y = 2$。

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