-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path6_3_addition_of_binary_numbers_function.cpp
115 lines (101 loc) · 1.76 KB
/
6_3_addition_of_binary_numbers_function.cpp
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include<iostream>
using namespace std;
// This code will not work for numbers like 1+1, 10101+11011, etc.
int reverse(int n)
{
int ans=0;
while(n>0)
{
int lastDigit=n%10;
ans=ans*10+lastDigit;
n/=10;
}
return ans;
}
int addBinary(int a,int b)
{
int ans=0;
int prevCarry=0;
while(a>0 && b>0)
{
if(a%2==0 && b%2==0)
{
ans=ans*10+prevCarry;
prevCarry=0;
}
else if((a%2==0 && b%2==1) || (a%2==1 && b%2==0))
{
if(prevCarry==1)
{
ans=ans*10+0;
prevCarry=1;
}
else
{
ans=ans*10+1;
prevCarry=0;
}
}
else
{
ans=ans*10+prevCarry;
prevCarry=1;
}
a/=10;
b/=10;
}
while(a>0)
{
if(prevCarry==1)
{
if(a%2==1)
{
ans=ans*10+0;
prevCarry=1;
}
else
{
ans=ans*10+1;
prevCarry=0;
}
}
else
{
ans=ans*10+(a%2);
}
a/=10;
}
while(b>0)
{
if(prevCarry==1)
{
if(b%2==1)
{
ans=ans*10+0;
prevCarry=1;
}
else
{
ans=ans*10+1;
prevCarry=0;
}
}
else
{
ans=ans*10+(b%2);
}
b/=10;
}
if(prevCarry==1)
{
ans=ans*10+1;
}
ans=reverse(ans);
return ans;
}
int main(){
int a,b;
cin>>a>>b;
cout<<addBinary(a,b);
return 0;
}