#S. JIXMPII5XHkZFF#)-':
JIXMPII5XHkZFF#)-':
该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。
Statement
Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite.
Format
Input
Input will consist of a single integer ( ), the number of city blocks that must be enclosed by the route.
Output
Print the minimum perimeter that can be achieved.
Sample
4
8
11
14
22
20
ShanghaiTech ACM 炸鱼杯
- 状态
- 已结束
- 规则
- OI
- 题目
- 46
- 开始于
- 2024-12-10 23:00
- 结束于
- 2024-12-15 13:00
- 持续时间
- 110 小时
- 主持人
-
_Arahc_
- 参赛人数
- 112