cf-626c

http://codeforces.com/problemset/problem/626/C
想着暴力过。。。结果可想而知

#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const int N=1000+10;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int main()
{
    int n,m;
    while(cin>>n>>m){
    int temp=6;
    int ans1=2*n,ans2=3*m;
    int temp2=min(ans1,ans2);
    while(temp2>=temp)
    {
        if(ans1>ans2)ans2+=3;
        else ans1+=2;
        temp+=6;
    }
    printf("%d",max(ans1,ans2));
    }
    return 0;
}

AC的二分代码：

#include<iostream>
using namespace std;
 
int n,m;
bool check(int x)
{
	int num1=x/2;
	int num2=x/3;
	int num3=x/6;
	if(num1<n) return false;
	if(num2<m) return false;
	if(min(num3,num1-n)<m-(num2-num3)) return false;
	//本题关键：利用贪心的思想，把2和3公倍数，尽可能的都给3，这样可能确保满足条件的值最小 
	return true;
}
 
int main()
{
	scanf("%d%d",&n,&m);
	int l=0,r=1e7,ans=0;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid))	ans=mid,r=mid-1;
		else l=mid+1;
	}
	printf("%d\n",ans);
	return 0;
}