在曼哈顿，对于每个整数 $i$，都有街道 $x = i$ 和 $y = i$。已知 Snuke 的家和 Smeke 的家都在这些街道上，且它们之间的欧几里得距离恰好为 $d$。请计算当他们沿街道行走时，两家之间可能的最大距离。
输入包含一个数字 $d$。
输出答案。如果答案的绝对误差或相对误差不超过 $10^{-9}$，则视为正确。
1.000
2.000000000000
2.345
3.316330803765
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.
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: