矩形 2 - Problem

#10988. 矩形 2

Statistics

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

Byteman 有 $n$ 个边长为 1 的正方形。他可以用这些正方形组成多少种不同的矩形？

如果两个矩形不能通过旋转和平移相互重合，则认为它们是不同的。在构建矩形的过程中，Byteman 不能使正方形变形，也不能将任何正方形叠放在其他正方形上。

输入格式

标准输入的第一行也是唯一一行包含一个整数 $n$ ($1 \le n \le 1\,000\,000\,000$)。

输出格式

标准输出的第一行也是唯一一行包含一个整数，表示 Byteman 可以用这些正方形组成的矩形总数。

样例

输入 1

输出 1

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