位运算
简介
位运算两个作用:
- 求n的第k位数字:
n >> k & 1
- 返回n的最后一位1:
lowbit(n) = n & -n
模板题
模板题分析
lowbit(x):
int lowbit(int x) { return x & -x; }
x的二进制表达式中最低位的1所对应的值(角标)
-x = ~x+1(取反x+1)
例如:
x=1010…100…0
~x=0101…011…1
~x+1=0101…100…0
x&(~x+1)=0000…100…0
每次减去x的最后一位1x -= lowbit(x)
,减了多少次,就说明x里面有多少个1res++
。
代码
//位运算
#include <iostream>
using namespace std;
//lowbit(x)是x的二进制表达式中最低位的1所对应的值(角标)
//-x = ~x+1(取反x+1)
int lowbit(int x) {
return x & -x;
}
/*
例如:
x=1010...100...0
~x=0101...011...1
~x+1=0101...100...0
x&(~x+1)=0000...100...0
*/
int main() {
int n;
cin >> n;
while (n--) {
int x;
cin >> x;
int res = 0;
while (x) {
//每次减去x的最后一位1
x -= lowbit(x);
res++;//减了多少次,就说明x里面有多少个1
}
cout << res << ' ';
}
return 0;
}
高精度
高精度加法
模板题
代码
//高精度加法
#include <iostream>
#include <vector>
using namespace std;
const int N = 1e6 + 9;
vector<int>add(vector<int> &A, vector<int> &B) {
vector<int>C;
int t = 0;
for (int i = 0; i < A.size() || i < B.size(); i++) {
if (i < A.size())
t += A[i];
if (i < B.size())
t += B[i];
C.push_back(t % 10);
t /= 10;
}
if (t)
C.push_back(1);
return C;
}
int main() {
string a, b;
vector<int>A, B;
cin >> a >> b;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i] - '0');
for (int i = b.size() - 1; i >= 0; i--)
B.push_back(b[i] - '0');
auto C = add(A, B);
for (int i = C.size() - 1; i >= 0; i--)
cout << C[i];
return 0;
}
高精度减法
模板题
代码
//高精度减法
#include <iostream>
#include <vector>
using namespace std;
//判断是否有A>=B
bool cmp(vector<int> &A, vector<int> &B) {
if (A.size() != B.size())
return A.size() > B.size();
for (int i = A.size() - 1; i >= 0; i--)//从高位开始比,即从vector最后开始
if (A[i] != B[i])
return A[i] > B[i];
return true;//到这里证明A==B,因为判断的是A是否>=B所以返回ture
}
vector <int>sub(vector<int> &A, vector<int> &B) {
vector<int>C;
for (int i = 0, t = 0; i < A.size(); i++) {
t = A[i] - t;
if (i < B.size())//逻辑应该是t=A[i]-B[i]-t,
t -= B[i];//但因为A>=B,当A位数大于B时会越界,所以需要加个判断
C.push_back((t + 10) % 10);
//当t>=0时,t需要=t,当t<0时,t需要=t+10,两种情况汇总就是(t+10)%10
if (t < 0)//借位处理
t = 1;
else
t = 0;
}
while (C.size() > 1 && C.back() == 0)
C.pop_back();
return C;
}
int main() {
string a, b;
vector<int>A, B;
cin >> a >> b;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i] - '0');//push_back要的时int类型哦
for (int i = b.size() - 1; i >= 0; i--)
B.push_back(b[i] - '0');
if (cmp(A, B)) {
auto C = sub(A, B);
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
} else {//B>A,相当于转换为A-B=-(B-A)
auto C = sub(B, A);
printf("-");
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
}
return 0;
}
高精度乘法
模板题
代码
//高精度乘法
#include <iostream>
#include <vector>
using namespace std;
vector<int>mul(vector<int>A, int b) {
vector<int>C;
int t = 0;
for (int i = 0; i < A.size() || t; i++) {
if (i < A.size())
t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
return C;
}
int main() {
string a;
int b;
cin >> a >> b;
vector<int>A;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i] - '0');
auto C = mul(A, b);
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
return 0;
}
高精度除法
模板题
代码
//高精度除法
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//A/b,商是C,余数是r
vector<int>div(vector<int> &A, int b, int &r) {
vector<int>C;
r = 0;
for (int i = A.size() - 1; i >= 0; i--) {
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0)
C.pop_back();
return C;
}
int main() {
string a;
int b;
cin >> a >> b;
vector<int>A;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i] - '0');
int r;
auto C = div(A, b, r);
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
cout << endl << r << endl;
return 0;
}