【CODEFORCES】 B. Wonder Room

B. Wonder Room

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The start of the new academic year brought about the problem of accommodation students into dormitories. One of such dormitories has a a × b square meter wonder room. The caretaker wants to accommodate exactly n students there. But the law says that there must be at least 6 square meters per student in a room (that is, the room for n students must have the area of at least 6n square meters). The caretaker can enlarge any (possibly both) side of the room by an arbitrary positive integer of meters. Help him change the room so as all n students could live in it and the total area of the room was as small as possible.

Input

The first line contains three space-separated integers n, a and b (1 ≤ n, a, b ≤ 109) — the number of students and the sizes of the room.

Output

Print three integers s, a1 and b1 (a ≤ a1; b ≤ b1) — the final area of the room and its sizes. If there are multiple optimal solutions, print any of them.

Sample test(s)

input

3 3 5

output

18
3 6

input

2 4 4

output

16
4 4

题解：我果然还是太水了....这题一开始竟然没写出来....

对于a1，从a一直枚举到sqrt(6*n)，算出每一个b1，与现有的答案比较，如果更优就输出。对于b1同理，最后输出答案和a1,b1即可。

#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

long long  n,a,b,t,p,ans,a1,b1;
int main()
{
    scanf("%I64d%I64d%I64d",&n,&a,&b);
    if (n*6<=a*b)
    {
        cout <<a*b<<endl;
        cout <<a<<" "<<b;
    }
    else
    {
        t=a; p=b;
        for (t=a;t<=ceil(sqrt(6*n));t++)
        {
            p=ceil((6*n)*1.0/t);
            if (p<b) p=b;
            if (t*p<ans || ans==0)
            {
                a1=t; b1=p;
                ans=a1*b1;
            }
            if (ans==6*n)
            {
                cout <<ans<<endl;
                cout <<a1<<" "<<b1;
                return 0;
            }
        }
        for (p=b;p<=ceil(sqrt(6*n));p++)
        {
            t=ceil((6*n)*1.0/p);
            if (t<a) t=a;
            if (t*p<ans || ans==0)
            {
                a1=t; b1=p;
                ans=a1*b1;
            }
            if (ans==6*n)
            {
                cout <<ans<<endl;
                cout <<a1<<" "<<b1;
                return 0;
            }
        }
        cout <<ans<<endl;
        cout <<a1<<" "<<b1;
    }
    return 0;
}