c++ std::bitset
转载自 作用:
及 64位 移位 取或 用64个位存储64个位,取 或 merge 。 然后查索引即知道id是否存在~~ 目标:省空间。
#include <iostream>
#include <bitset>
#include <string>
using namespace std; int main(){ //bitset<n> b;//b有n位,每位都为0
bitset<> bitvec;
cout << bitvec << endl; //bitset<n> b(u); //b是unsigned long型u的一个副本
bitset<> bitvec2(0xffff);
cout << bitvec2 << endl; bitset<> bitvec3(0xffff);
cout << bitvec3 << endl; //bitset<n> b(s); //b是string对象s中含有的位串的副本
string strval("");
bitset<> bitvec4(strval);
cout << bitvec4 << endl; string str("");
//bitset<n> b(s, pos, n);//b是s中从位置pos开始的n个位的副本
bitset<> bitvec5(str, , );
cout << bitvec5 << endl;
bitset<> bitvec6(str, str.size() - );
cout << bitvec6 << endl; cout << sizeof(unsigned long) << endl; //unsigned long a = 1;
//unsigned long b = a << 63;
uint64_t a = ;
uint64_t b = a << ;
bitset<> vec(b);
cout << vec << endl;
return ;
} output: 0000000000000000 16
1111111111111111 16
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001111111111111111 128
00000000000000000000000000001100 32
00000000000000000000000000001100 32
00000000000000000000000000001101 32
8 1
1000000000000000000000000000000000000000000000000000000000000000 64
------------------------------------------- #include <iostream>
#include <stdint.h>
#include <bitset>
using namespace std; int main() {
for(int i=0; i<64; i++){
uint64_t a = 1;
uint64_t b = a << i;
bitset<64> bs(b);
cout << i << " \t" << bs << "," << bs.to_ulong() << endl;
}
bitset<64> sum_bin;
sum_bin.set();
cout << "\t" << sum_bin << "," << sum_bin.to_ulong() << endl; return 0;
} 0 0000000000000000000000000000000000000000000000000000000000000001,1
1 0000000000000000000000000000000000000000000000000000000000000010,2
2 0000000000000000000000000000000000000000000000000000000000000100,4
3 0000000000000000000000000000000000000000000000000000000000001000,8
4 0000000000000000000000000000000000000000000000000000000000010000,16
5 0000000000000000000000000000000000000000000000000000000000100000,32
6 0000000000000000000000000000000000000000000000000000000001000000,64
7 0000000000000000000000000000000000000000000000000000000010000000,128
8 0000000000000000000000000000000000000000000000000000000100000000,256
9 0000000000000000000000000000000000000000000000000000001000000000,512
10 0000000000000000000000000000000000000000000000000000010000000000,1024
11 0000000000000000000000000000000000000000000000000000100000000000,2048
12 0000000000000000000000000000000000000000000000000001000000000000,4096
13 0000000000000000000000000000000000000000000000000010000000000000,8192
14 0000000000000000000000000000000000000000000000000100000000000000,16384
15 0000000000000000000000000000000000000000000000001000000000000000,32768
16 0000000000000000000000000000000000000000000000010000000000000000,65536
17 0000000000000000000000000000000000000000000000100000000000000000,131072
18 0000000000000000000000000000000000000000000001000000000000000000,262144
19 0000000000000000000000000000000000000000000010000000000000000000,524288
20 0000000000000000000000000000000000000000000100000000000000000000,1048576
21 0000000000000000000000000000000000000000001000000000000000000000,2097152
22 0000000000000000000000000000000000000000010000000000000000000000,4194304
23 0000000000000000000000000000000000000000100000000000000000000000,8388608
24 0000000000000000000000000000000000000001000000000000000000000000,16777216
25 0000000000000000000000000000000000000010000000000000000000000000,33554432
26 0000000000000000000000000000000000000100000000000000000000000000,67108864
27 0000000000000000000000000000000000001000000000000000000000000000,134217728
28 0000000000000000000000000000000000010000000000000000000000000000,268435456
29 0000000000000000000000000000000000100000000000000000000000000000,536870912
30 0000000000000000000000000000000001000000000000000000000000000000,1073741824
31 0000000000000000000000000000000010000000000000000000000000000000,2147483648
32 0000000000000000000000000000000100000000000000000000000000000000,4294967296
33 0000000000000000000000000000001000000000000000000000000000000000,8589934592
34 0000000000000000000000000000010000000000000000000000000000000000,17179869184
35 0000000000000000000000000000100000000000000000000000000000000000,34359738368
36 0000000000000000000000000001000000000000000000000000000000000000,68719476736
37 0000000000000000000000000010000000000000000000000000000000000000,137438953472
38 0000000000000000000000000100000000000000000000000000000000000000,274877906944
39 0000000000000000000000001000000000000000000000000000000000000000,549755813888
40 0000000000000000000000010000000000000000000000000000000000000000,1099511627776
41 0000000000000000000000100000000000000000000000000000000000000000,2199023255552
42 0000000000000000000001000000000000000000000000000000000000000000,4398046511104
43 0000000000000000000010000000000000000000000000000000000000000000,8796093022208
44 0000000000000000000100000000000000000000000000000000000000000000,17592186044416
45 0000000000000000001000000000000000000000000000000000000000000000,35184372088832
46 0000000000000000010000000000000000000000000000000000000000000000,70368744177664
47 0000000000000000100000000000000000000000000000000000000000000000,140737488355328
48 0000000000000001000000000000000000000000000000000000000000000000,281474976710656
49 0000000000000010000000000000000000000000000000000000000000000000,562949953421312
50 0000000000000100000000000000000000000000000000000000000000000000,1125899906842624
51 0000000000001000000000000000000000000000000000000000000000000000,2251799813685248
52 0000000000010000000000000000000000000000000000000000000000000000,4503599627370496
53 0000000000100000000000000000000000000000000000000000000000000000,9007199254740992
54 0000000001000000000000000000000000000000000000000000000000000000,18014398509481984
55 0000000010000000000000000000000000000000000000000000000000000000,36028797018963968
56 0000000100000000000000000000000000000000000000000000000000000000,72057594037927936
57 0000001000000000000000000000000000000000000000000000000000000000,144115188075855872
58 0000010000000000000000000000000000000000000000000000000000000000,288230376151711744
59 0000100000000000000000000000000000000000000000000000000000000000,576460752303423488
60 0001000000000000000000000000000000000000000000000000000000000000,1152921504606846976
61 0010000000000000000000000000000000000000000000000000000000000000,2305843009213693952
62 0100000000000000000000000000000000000000000000000000000000000000,4611686018427387904
63 1000000000000000000000000000000000000000000000000000000000000000,9223372036854775808
1111111111111111111111111111111111111111111111111111111111111111,18446744073709551615
c++ std::bitset的更多相关文章
- 记录一个比较少用的容器C++ std::bitset
bitset存储二进制数位. bitset就像一个bool类型的数组一样,但是有空间优化——bitset中的一个元素一般只占1 bit,相当于一个char元素所占空间的八分之一. bitset中的每个 ...
- DFS序+线段树+bitset CF 620E New Year Tree(圣诞树)
题目链接 题意: 一棵以1为根的树,树上每个节点有颜色标记(<=60),有两种操作: 1. 可以把某个节点的子树的节点(包括本身)都改成某种颜色 2. 查询某个节点的子树上(包括本身)有多少个不 ...
- 把《c++ primer》读薄(3-3 标准库bitset类型)
督促读书,总结精华,提炼笔记,抛砖引玉,有不合适的地方,欢迎留言指正. //开头 #include <bitset> using std::bitset; 问题1.标准库bitset类型( ...
- (DFS、bitset)AOJ-0525 Osenbei
题目地址 简要题意: 给出n行m列的0.1矩阵,每次操作可以将任意一行或一列反转,即这一行或一列中0变为1,1变为0.问通过任意多次这样的变换,最多可以使矩阵中有多少个1. 思路分析: 行数比较小,先 ...
- 【状压dp】【bitset】bzoj1688 [Usaco2005 Open]Disease Manangement 疾病管理
vs(i)表示患i这种疾病的牛的集合. f(S)表示S集合的病被多少头牛患了. 枚举不在S中的疾病i,把除了i和S之外的所有病的牛集合记作St. f(S|i)=max{f(S)+((St|vs(i)) ...
- Bitset 用法(STL)
std::bitset是STL的一个模板类,它的参数是整形的数值,使用位的方式和数组区别不大,相当于只能存一个位的数组.下面看一个例子 bitset<20> b1(5); cout< ...
- bitset常用函数用法记录 (转载)
有些程序要处理二进制位的有序集,每个位可能包含的是0(关)或1(开)的值.位是用来保存一组项或条件的yes/no信息(有时也称标志)的简洁方法.标准库提供了bitset类使得处理位集合更容易一些.要使 ...
- bzoj 3687 bitset的运用
题目大意: 小呆开始研究集合论了,他提出了关于一个数集四个问题:1. 子集的异或和的算术和.2. 子集的异或和的异或和.3. 子集的算术和的算术和.4. 子集的算术和的异或和.目前为止,小呆已经解决了 ...
- 标准非STL之bitset
template <size_t N> class bitset; BitsetA bitset stores bits (elements with only two possible ...
随机推荐
- powershell查看pc信息的常用命令
Ps:powershell功能十分强大,这里只是简单说明一些比较常用的 get-wmiobject(获取对象) 查看本机的BIOS信息 1. 使用命令:get-wmiobject Wi ...
- HTML+CSS学习笔记 (15) - css样式设置小技巧
水平居中设置-行内元素 我们在实际工作中常会遇到需要设置水平居中场景,今天我们就来看看怎么设置水平居中的. 如果被设置元素为文本.图片等行内元素时,水平居中是通过给父元素设置 text-align:c ...
- Objective-C排序算法实现
算法作为程序猿的一种基本技能,对我来说却一直是一个硬伤.毕竟平时的工作接触算法的地方很少,大部分时间都是在搭建UI,写业务逻辑,写网络请求.然而在面试当中,算法往往又是考察的重点. 也许你会说这些平时 ...
- 【学习笔记】【C语言】字符串数组
1.使用场合 * 一维字符数组中存放一个字符串,比如一个名字char name[20] = "mj" * 如果要存储多个字符串,比如一个班所有学生的名字,则需要二维字符数组,cha ...
- 【学习笔记】【C语言】循环结构-do while
用法: while (条件) { } do { } while(条件); while和do-while的区别 1.很多情况下,while和do while可以互换 2.while特 ...
- 【学习笔记】【C语言】算术运算
C语言一共有34种运算符,包括了常见的加减乘除运算 1. 加法运算+ 除开能做加法运算,还能表示正号:+5.+90 2. 减法运算- 除开能做减法运算,还能表示符号:-10.-29 3. 乘法运算* ...
- .Net的基础概念
1,参数传递. 默认都是按值传递(无论引用还是值类型),也就意味着传递参数的一个副本给方法.之后在方法体内对参数的更改,对原始参数没有影响. 使用ref/out可以按引用传递,直接影响原始参数变量.两 ...
- HTML5+CSS3+JQuery打造自定义视频播放器
来源:http://www.html5china.com/HTML5features/video/201109206_1994.html 简介HTML5的<video>标签已经被目前大多数 ...
- Android 多国语言
参考android 开发文档, ISO 639-1 ISO 3166-1-alpha-2 关于中国的: 中国其他地区: https://en.wikipedia.org/wiki/ISO_3166 ...
- laravel框架少见方法详解
1.whereDate() 方法 $q->where('created_at', '>=', date('Y-m-d').' 00:00:00')); 以前查数据时,直接用where条件来 ...