【codeforces】 466B Wonder Room

暴力枚举即可。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

LL a, b, n;
void read(void)
{
	scanf("%I64d%I64d%I64d", &n, &a, &b);
}
void work(void)
{
	LL t = 6 * n, mi = INF, ans_a, ans_b, tt;
	t = sqrt(t);
	ans_a = a, ans_b = b;
	if(a * b > 6 * n) mi = a * b;
	for(int i = a; i <= t; i++) {
		tt = max(b, (6 * n + i - 1) / i);
		if(tt * i < mi) mi = tt * i, ans_a = i, ans_b = tt;
	}
	for(int i = b; i <= t; i++) {
		tt = max(a, (6 * n + i - 1) / i);
		if(tt * i < mi) mi = tt * i, ans_a = tt, ans_b = i;
	}
	printf("%I64d\n%I64d %I64d\n", mi, ans_a, ans_b);
}
int main(void)
{
	read();
	work();
	return 0;
}