Codeforces 859B Lazy Security Guard

B. Lazy Security Guard

time limit per test：2 seconds
memory limit per test：256 megabytes

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 N city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly N 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.

Input
Input will consist of a single integer N (1 ≤ N ≤ 106), the number of city blocks that must be enclosed by the route.

Output
Print the minimum perimeter that can be achieved.

Examples

input
4
output
8

input
11
output
14

input
22
output
20

Note
Here are some possible shapes for the examples:

---

题意：
给你n个大小相等的正方形，要求它们组合在一起后的最小周长。

思路：
因为这个周长和一个矩形的没什么区别，所以结果是能覆盖n个小正方形的最小的正方形或者长短边相差1的矩形的周长。

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll n;
    while(cin>>n)
    {
        ll a=sqrt(n);
        if(a*a==n) cout<<a*4<<endl;
        else if(a*(a+1)>=n) cout<<a*4+2<<endl;
        else cout<<a*4+4<<endl;
    }
}

---

为啥这么简单的题我还要写题解……因为我写得确实太傻了，人家就一句话：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll n;
    while(cin>>n)
        cout<<2*ceil(2*sqrt(n))<<endl;
}

仔细想了下这样写确实是对的QAQ但是我就是想不到