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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
| #include <iostream>
using namespace std;
void showVec(int * vec, int n);
int main()
{
int a, b;
cout<<"a = ";cin>>a;
cout<<"b = ";cin>>b;
int nA = 0;
int nB = 0;
int nC = 0;
int * binA = getBinArray(a, nA);
int * binB = getBinArray(b, nB);
int * binC = getBinSum(binA, nA, binB, nB, nC);
cout<<"Binary a : ";showVec(binA, nA);
cout<<"Binary b : ";showVec(binB, nB);
cout<<"Binary c : ";showVec(binC, nC);
cout<<"Dec c : "<<getDecValue(binC, nC)<<endl;
cout<<"Dec a + b : "<<a + b<<endl;
delete [] binA;
delete [] binB;
delete [] binC;
return 0;
}
int * getBinArray(int val, int &n)
{
n = 1;
int buf = val;
while(buf /= 2)
n = n + 1;
int * arr = new int[n];
for(int i = 0; i < n; i++)
{
arr[n - 1 - i] = val % 2;
val = val / 2;
}
return arr;
}
int * getBinSum(int * a, int na, int *b, int nb, int &nc)
{
nc = 1 + ((na < nb) ? nb : na);
int *c = new int[nc + 1];
int shift = 0;
for(int i = 0; i < nc; i++)
{
c[nc - 1 - i] = shift;
if(i < na)
c[nc - 1 - i] += a[na - 1 - i];
if(i < nb)
c[nc - 1 - i] += b[nb - 1 - i];
shift= 0;
if(1 < c[nc - 1 - i])
{
c[nc - 1 - i] = 0;
shift= 1;
}
}
return c;
}
int getDecValue(int * c, int nc)
{
int val = 0;
int pwr = 1;
for(int i = 0; i < nc; i++)
{
val += c[nc - 1 - i]*pwr;
pwr *= 2;
}
return val;
}
void showVec(int * vec, int n)
{
for(int i = 0; i < n; i++)
cout<<vec[i]<<" ";
cout<<endl;
} |
(
