bitset 使用

http://blog.163.com/lixiangqiu_9202/blog/static/53575037201251121331412/

http://blog.youkuaiyun.com/acm_10000h/article/details/40951033

poj3652
位运算模拟 异或获取不相同的位，|运算累计所有不相同的位

#include <iostream>
#include <cstdio>
#include <bitset>
#include<string>
using namespace std;
const int N=65536+8;

int a,b,c,s;
bitset<16>bin,bin2;
int n,x;
int result;
string ss;
int main(){
    while(cin>>a>>b>>c>>s){
        n=1;
        x=s;
        result=0;
        while((x=(a*x+b)%c)!=s&&n!=c){
            n++;
          //  cout<<x<<endl<<s<<endl;
            result|=(x^s);
        }
        bin=result;
        bin2=s;

        for(int i=15;i>=0;--i){
        if(bin[i]==1)cout<<'?';
        else cout<<bin2[i];
        }
        cout<<endl;
    }
    return 0;
}