Codeforces Round #628 (Div. 2) D. Ehab the Xorcist（数学）

思路：

int main() {
    ll x,y,u,v;
    cin>>u>>v;
    if((v-u)%2!=0)
        cout<<-1<<endl;
    else{
        if(v-u>0){
            x=(v-u)/2;
            y=(v+u)/2;
            if((x^y)==u){
                cout<<2<<endl;
                cout<<x<<" "<<y<<endl;
            } else{
                cout<<3<<endl;
                cout<<(v-u)/2<<" "<<(v-u)/2<<" "<<u<<endl;
            }
        } else if(u==v){
            if(u==0&&v==0)
                cout<<0<<endl;
            else{
                cout<<1<<endl;
                cout<<u<<endl;
            }
        } else
            cout<<-1<<endl;
    }
}