紧密堆积 - Problema

#2755. 紧密堆积

Estadísticas

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

考虑将小部件装箱运输，其中小部件不能堆叠（二维装箱）。每个小部件的占地面积为 $1 \times 1$，高度为 $1$ 个单位。

现有的箱子尺寸为任意 $W \times H \times 1$，需满足 $H/2 \le W \le 2H$，其中 $W$ 和 $H$ 均为整数。公司希望最小化填充箱子中空余方格所需的包装材料。

给定需要运输的小部件数量 $N$，当这些小部件装箱运输时，最少会剩下多少个空余方格？

输入格式

输入包含一行，为一个整数 $N$，表示需要装箱的小部件数量。$1 \le N \le 10^{16}$。

输出格式

输出一行，包含一个整数，表示最少剩下的空余方格数量。

样例

输入格式 1

输出格式 1

输入格式 2

输出格式 2

输入格式 3

10000000000001

输出格式 3

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