competetive-programming/BitWise.cpp at master · anandshivam44/competetive-programming · 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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ull unsigned long long int
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
const ll mod = 1000000007;
const ll inf = 1e18;
#define all(x) begin(x), end(x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define print_array(arr)                                         \
    loop(z, sizeof(arr) / sizeof(arr[0])) cout << arr[z] << " "; \
    cout << "\n"
#define print_vector(vvv)                      \
    loop(z, vvv.size()) cout << vvv[z] << " "; \
    cout << "\n"
#define print_vector_pair(vvv)                                             \
    loop(z, vvv.size()) cout << vvv[z].first << " " vvv[z].second << "\n"; \
    cout << "\n"
#define fill_my(arr, q) fill(all(arr), q)

int binaryToDecimal(unsigned long long int n)
{
    unsigned long long int num = n;
    unsigned long long int dec_value = 0;

    // Initializing base value to 1, i.e 2^0
    unsigned long long int base = 1;

    unsigned long long int temp = num;
    while (temp)
    {
        unsigned long long int last_digit = temp % 10;
        temp = temp / 10;

        dec_value += last_digit * base;

        base = base * 2;
    }

    return dec_value;
}
void bin(unsigned long long int n)
{
    if (n > 1)
        bin(n >> 1);

    //printf("%d", n & 1);
    cout << (n & 1);
}
int decimalToBinary(int N)
{

    // To store the binary number
    int B_Number = 0;
    int cnt = 0;
    while (N != 0)
    {
        unsigned long long int rem = N % 2;
        ull c = pow(10, cnt);
        B_Number += rem * c;
        N /= 2;

        // Count used to store exponent value
        cnt++;
    }

    return B_Number;
}
void solve()
{
    // int x = 6;
    // bin(x);
    cout << endl;
    unsigned long long int k = 10001011;
    unsigned long long int t = binaryToDecimal(k);
    cout << k << " = " << t << endl;
    t = t*7;
    k = decimalToBinary(t);
    cout << k << " = " << t << endl;
}
// cout << __builtin_ctz(x) << endl;
// if (x % 4 == 1)
// {
//     cout << x << " is odd " << endl;
// }
// else
// {
//     cout << x << " is even " << endl;
//     ;
// }

// for (int i = 0; i <= 100; i++)
// {
//     bin(x);
//     cout << " ";
//     bin(i);
//     cout << " ";
//     if (x & i)
//     {
//         cout << " True " << endl;
//     }
//     else
//     {
//         cout << " False " << endl;
//     }
// }

// int temp = x;
// for (int i = 0; (1 << i) <= x; i++)
//     if (x & (1 << i))
//         cout << i << " ";

// for (int i = 0; i < 30; i++)
//     if ((x & (1 << i)) != 0)
//         cout << i << " ";

// bin(n);
// for (int i = 0; i <= 10; i++)
// {
//     cout << i << "   " << (1024 >> (i * (-1))) << endl;
// }

// for (int i = 0; i <= 150; i++)
// {
//     // if ((n & (1 << i)) != 0)
//     // {
//     //     cout << 1;
//     // }
//     // else
//     // {
//     //     cout << 0;
//     // }
//     n = temp;
//     for (int j = 0; j <= i; j++)
//     {
//         if ((n & (1ULL << j)) != 0)
//         {
//             cout << 1;
//         }
//         else
//         {
//             cout << 0;
//         }
//     }
//     cout << endl;
// }

int main()
{
    clock_t time_req;
    time_req = clock();
    cin.sync_with_stdio(false);
    cin.tie(0);

    // int t;
    // cin >> t;
    // while (t--)
    // {
    //     solve();
    // }
    solve();

    time_req = clock() - time_req;
    cout << "\nProcessor time " << (float)time_req / CLOCKS_PER_SEC
         << " sec" << endl;
    return 0;
}