codeoforces 1250F Data Center 水题

http://codeforces.com/problemset/problem/1250/F
You are developing a project to build a new data center. The data center will be a rectangle with an area of exactly n square meters. Each side of the data center must be an integer.

Your goal is to minimize the impact of the external environment on the data center. For this reason, you want to minimize the length of the perimeter of the data center (that is, the sum of the lengths of its four sides).

What is the minimum perimeter of a rectangular data center with an area of exactly n square meters, if the lengths of all its sides must be integers?

Input
The first and only line of the input contains an integer n (1≤n≤105), where n is the area of the data center in square meters.

Output
Print the required minimum perimeter in meters.

题目大意：给出一个长方形的面积，其边长都是整数，求周长的最小值。
思路：直接暴力，水题。

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;

int n;

int main()
{
	scanf("%d",&n);
	int ans=INF;
	for(int i=1;i*i<=n;i++)
	{
		if(n%i==0)
		{
			int tmp=n/i;
			ans=min(ans,2*(tmp+i));
		}
	}
	printf("%d\n",ans);
	return 0;
}