【CodeForces 626C】Block Towers

#include<cstdio>
#include<algorithm>
using namespace std;

int main()
{
    int n,m,i;
    scanf("%d%d",&n,&m);
    i=max(2*n,3*m);
    while(i/2+i/3-i/6<n+m||i/2<n||i/3<m)
    {
        i++;
    }
    printf("%d",i);
    return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;

int main()
{
    int n,m,end1,end2;
    scanf("%d%d",&n,&m);
    end1=2*n;
    end2=3*m;
    for(int i=6; i<=min(end1,end2); i+=6)
    {
        if(end1<=end2)//如果相等，加到2的倍数，更小
        {
            end1+=2;
        }
        else
        {
            end2+=3;
        }
    }
    printf("%d",max(end1,end2));
    return 0;
}