POJ 2363

时间:2023-03-09 08:49:37
POJ 2363
#include<iostream>
#include<stdio.h>
using namespace std; int main()
{
//freopen("acm.acm","r",stdin);
int test;
int num;
int i;
int j;
int max;
int tem;
int h;
int are;
cin>>test;
while(test --)
{
max = ;
cin>>num;
for(h = ; h <= num; ++ h)
{
if(num%h == )
{
are = num/h;
for(i = ; i*i < are + ; ++ i)
{
if(are%i == )
{
j = are/i;
tem = *i*j + *i*h + *j*h;
if(tem < max)
max = tem;
}
}
}
}
cout<<max<<endl;
}
}