位运算
快速幂取模
long long Mode(ll a, ll b, ll m){
if (b == 0) return 1 % m; // 千万要记得这一句,要不然会被求0次方卡掉的
ll ans = 1;
while (b){
if (b & 1){
ans = (ans * a) % m;
}
a = (a * a) % m;
b >>= 1;
}
return ans;
}
快速乘取模
long long multiply(ll a, ll b, ll m){
if (a == 0 || b == 0) return 0;
ll ans = 0;
while (b){
if (b & 1){
ans = (ans + a) % m;
}
a = (a + a) % m;
b >>= 1;
}
return ans;
}
哈夫曼路径
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstream>
#include <list>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(s) memset(s, 0, sizeof(s))
const int inf = 0x3f3f3f3f;
#define LOCAL
const int N = 21, M = 1 << 20;
int n;
int f[M][N], weight[N][N];
int main(int argc, char * argv[])
{
while (cin >> n){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cin >> weight[i][j];
}
}
memset(f, 0x3f, sizeof(f));
f[1][0] = 0;
for (int i = 0; i < 1 << n; i++){
for (int j = 0; j < n; j++){
if (i >> j & 1){ // 第i个状态的第j位是不是1。
for (int k = 0; k < n; k++){
if ((i - (1 << j)) >> k & 1){
f[i][j] = min(f[i][j], f[i - (1 << j)][k] + weight[k][j]);
}
}
}
// cout << f[i][j] << " ";
}
//cout << endl;
}
cout << f[(1 << n) - 1][n - 1] << endl;
return 0;
}
return 0;
}
用异或来求配对的数
把数字从0,1开始两两配对,(0, 1), (2, 3), (4, 5)...以此类推。
每个数异或1就会得到跟它配对的数。
比如0 ^ 1 = 1, 1 ^ 0 = 0
, 4 ^ 1 = 5, 5 ^1 = 4
lowbit运算
运算性质
二进制形式的数,从右到左取,取到第一个1为止。
lowbit(1110010000) = 10000
n = 1110010000
~n + 1 = 0001101111 + 1 = 0001110000
(~n + 1) & n = (0001110000) & (1110010000) = 10000
所以,实现如下
int lowbit(n){
return (~n + 1) & n;
// 因为~n + 1就是-n的补码,所以也等价于(-n) & n。
}