【牛客网】二进制插入/替换

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include<vector>
#include <iostream>
using namespace std;
class BinInsert {
public:
int binInsert(int n, int m, int j, int i) {
vector<int> v1;
vector<int> v2;
int count = 0;
while (n)
{
v1.push_back(n & 1);
n = n >> 1;
}
while (m)
{
v2.push_back(m & 1);
m = m >> 1;
}
for (int a = 0; a<v2.size(); a++)
{
v1[j++] = v2[a];
}
for (int b = 0; b<v1.size(); b++)
count += v1[b] * pow(2, b);
return count;
}
};
int main()
{
int n = 0;
int m = 0;
int i = 0;
int j = 0;
cin >> n;
cin >> m;
cin >> i;
cin >> j;
BinInsert b;
int a=b.binInsert(n, m, i, j);
cout << a << endl;
return 0;
}

1
2
3
4
5
6
7
8
9
class BinInsert {
public:
int binInsert(int n, int m, int j, int i) {
m = m << j;
n = n | m;
return n;
}
};