QOJ.ac

QOJ

时间限制: 3 s 内存限制: 1024 MB 总分: 100

#4991. 圆盘区域

统计

你住在平地(Flatland)的圆盘区(Disc District),并在最近便利地块公司(NCPC)工作。你的任务是找到圆盘区外最近的便利地块以供建造。

圆盘区可以描述为平面上一个圆心为 $(0, 0)$、半径为 $r$ 的圆盘。因此,如果一个点到原点的(欧几里得)距离严格大于 $r$,则该点位于圆盘区之外。平面上的点 $(x, y)$ 如果 $x$ 和 $y$ 均为整数,则被称为便利地块。

新西兰的塔拉纳基山。图片来自 NASA。

输入格式

输入仅包含一行,为一个整数 $r$ ($1 \le r \le 10^6$)。

输出格式

输出应包含一行,包含两个整数 $x$ 和 $y$,表示距离圆盘区最近的便利建筑地块的坐标。如果存在多个答案,输出其中任意一个即可。

样例

样例输入 1

1

样例输出 1

1 1

样例输入 2

8

样例输出 2

4 7

样例输入 3

90210

样例输出 3

69551 57450

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.