位元運算

這叫做bitwise operation，像是逐位的or 就稱為bitwise or、逐位xor 稱為bitwise xor 等等。

以下是C++ 的位元運算子列表：. 運算子, 說明 ... WiwiHo的競程筆記 === -[說明與目錄](/@wiwiho/ryjHQtWLH) 基本知識 --- -[複雜度分析](/@wiwiho/CPN-complexity) \-小技巧 --- -[前置處理器](/@wiwiho/CPN-preprocessor) \-輸入／輸出流 --- -[I/OStream概述](/@wiwiho/CPN-iostream) -[I/OStream的控制](/@wiwiho/CPN-io-control) -[StringStream](/@wiwiho/CPN-stringstream) -[I/O優化](/@wiwiho/CPN-io-optimization) 資料儲存 --- \-數字儲存與位元運算 --- -[進位制轉換](/@wiwiho/CPN-radix-convert) -[整數的儲存](/@wiwiho/CPN-integer-type) -[小數的儲存](/@wiwiho/CPN-float-type) -[位元運算](/@wiwiho/CPN-bitwise-operator) \-資料結構 --- -[動態陣列](/@wiwiho/CPN-dynamic-array) -[鏈結串列LinkedList](/@wiwiho/CPN-linked-list) -[堆疊Stack](/@wiwiho/CPN-stack) -[佇列Queue](/@wiwiho/CPN-queue) 演算法設計 --- \-動態規劃 --- -[Aliens優化](/@wiwiho/CPN-aliens) 序列問題 --- \-序列與區間操作 --- -[區間問題概述](/@wiwiho/CPN-range-query) -[分塊法](/@wiwiho/CPN-sqrt-decomposition) -[稀疏表SparseTable](/@wiwiho/CPN-sparse-table) -[線段樹SegmentTree](/@wiwiho/CPN-segment-tree) -[樹狀數組BinaryIndexedTree(FenwickTree)](/@wiwiho/CPN-binary-indexed-tree) -[莫隊算法Mo'sAlgorithm](/@wiwiho/CPN-mo-algorithm) \-字串String --- -[最長迴文子字串](/@wiwiho/CPN-lps) 圖論 --- 數學 --- \-計算幾何ComputationalGeometry --- -[向量](/@wiwiho/CPN-vector) -[向量應用](/@wiwiho/CPN-vector-application) -[凸包](/@wiwiho/CPN-convex-hull) -[旋轉卡尺](/@wiwiho/CPN-rotating-caliper) ######tags:`CompetitiveProgrammingNote` {} Expandmenu