hdu 5224 Tom and paper

最新推荐文章于 2019-07-09 01:53:10 发布

GadyPu

最新推荐文章于 2019-07-09 01:53:10 发布

阅读量346

点赞数

分类专栏：杂题

本文链接：https://blog.csdn.net/u012077152/article/details/46730337

版权

杂题专栏收录该内容

54 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=5224

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
using std::min;
using std::cin;
using std::cout;
using std::endl;
using std::find;
using std::sort;
using std::map;
using std::pair;
using std::vector;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
const int Max_N = 100010;
const int INF = ~0u >> 1;
typedef unsigned long long ull;
void solve(int n) {
    int ans = INF;
    for (int i = 1; (ull)i * i <= n; i++) {
        if (n % i == 0) ans = min(ans, (i + n / i) << 1);
    }
    printf("%d\n", ans);
}
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int t, n;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        solve(n);
    }
    return 0;
}