3107: [cqoi2013]二进制a+b

题目链接

题目大意：给定n位二进制数a,b,c，重组三个数，使得a′+b′=c′且最小化c′

题解：orz popoqqq

我的收获：无限ym

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int Digit(int x)
{
    int re=0;
    while(x)
        ++re,x>>=1;
    return re;
}
int Count(int x)
{
    int re=0;
    while(x)
        x^=x&-x,++re;
    return re;
}
int main()
{
    //freopen("3107.in","r",stdin);
    //freopen("3107.out","w",stdout);
    int x,y,z,limit,ans;
    cin>>x>>y>>z;
    limit=max( max( Digit(x) , Digit(y) ) , Digit(z) );
    x=Count(x);y=Count(y);z=Count(z);
    if(x<y) swap(x,y);
    if(z<=y) ans=((1<<x)-1)+((1<<z)-1|((1<<y-z)-1<<x));
    else if(z<=x) ans=((1<<x)-1)+((1<<y)-1<<z-y);
    else if(z<=x+y) ans=((1<<x)-1<<z-x)+((1<<z-x)-1|((1<<x+y-z)-1<<z+z-x-y));
    else ans=-1;
    if(Digit(ans)>limit) ans=-1;
    cout<<ans<<endl;
    return 0;
}