Codeforces Round #266 (Div.2) B Wonder Room --枚举

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define lll __int64
using namespace std;

int main()
{
    lll n,a,b;
    lll mini,a1,b1;
    while(scanf("%I64d%I64d%I64d",&n,&a,&b)!=EOF)
    {
        mini = (1LL<<62);
        lll sum = (lll)6*n;
        for(lll i=a;i<=a+50000LL;i++)
        {
            lll tb = sum/i + (sum%i!=0);
            tb = max(b,tb);
            lll tarea = i*tb;
            if(tarea < mini)
            {
                mini = tarea;
                a1 = i;
                b1 = tb;
            }
        }
        for(lll i=b;i<=b+50000LL;i++)
        {
            lll ta = sum/i + (sum%i!=0);
            ta = max(a,ta);
            lll tarea = i*ta;
            if(tarea < mini)
            {
                mini = tarea;
                a1 = ta;
                b1 = i;
            }
        }
        cout<<mini<<endl<<a1<<" "<<b1<<endl;
    }
    return 0;
}