competitive-coding-questions/57.cpp at master · adityamangal1998/competitive-coding-questions · GitHub

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
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin.tie(NULL);
	#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	#endif
	lli a,b;
	cin>>a;
	cin>>b;
	lli temp,temp1;
	int bit_array[61]= {0};
	int h_m_b = log2(b)/log2(2);
	// cout<<"h_m_b = "<<h_m_b<<"\n";
	temp = b;
	temp1 = a;
	for (int i = 0; i <=h_m_b; i++)
	{
		if((temp)&1)
			{
				bit_array[i]=1;
			}
		temp = temp>>1;
		if((temp1)&1)
			{
				bit_array[i]=1;
			}
		temp1 = temp1>>1;
	}
	int flag =0;
	int index;
	for (int i = 0; i <=h_m_b; i++)
	{
		if((bit_array[i]==1)&&(flag==0))
			{
				flag=1;
				index = i;
			}
		if(flag==1)
			{
				bit_array[i]=1;
			}
	}
	// cout<<"\n";
	// for (int i = 0; i <=h_m_b; i++)
	// {
	// 	cout<<bit_array[i]<<" ";
	// }
	// cout<<"\n";
	lli num=0;
	lli co = 0;
	for (int i = 0; i <=h_m_b; i++)
	{
		if(bit_array[i]==1)
			{
				co++;
			}
	}
	// cout<<"co "<<co;
	for (int i = 0; i <=h_m_b; i++)
	{
		num = num + (bit_array[i]*pow(2,i));
	}
	// cout<<num<<"\n";
	lli count;
	count = b-a+1;
	if(num==b)
	{
		cout<<count;
	}
	else if((num-b)==(b-a))
	{
		count = (b-a)*2+1;
		cout<<count;
	}
	else if((num-b)<(b-a))
	{
		count = (b-a) + num - b + pow(2,index);
		cout<<count;
	}
	else if(co==(h_m_b+1))
		{
			cout<<(b-a)+2;
		}
	else if((num-b)>(b-a))
	{
		count = (b-a)*2 ;
		cout<<count;
	}

}