10.bitset

#include <iostream>
//位运算,处理二进制非常方便,线性存储
#include <bitset>
#include <string>
using namespace std;

void main()
{
    //bitset<8> mybit(255);//1111 1111
    //for (int i = 7; i >= 0; i--)
    //{
    //    cout << mybit[i] << endl;
    //}
    int num = -1;
    bitset<32> mybit(num);
    for (int i = 31; i >= 0; i--)
    {
        cout << mybit[i];
    }

    string strl = mybit.to_string();//转化字符串
    unsigned long longl = mybit.to_ulong();//转化为无符号整数

    cout << "str1:" << strl << endl;
    cout << "longl:" << longl << endl;

    mybit.reset();//重置
    mybit.set(13, 1);//设置二进制位
    cin.get();
}