Bit Manipulation

Author: Dhruvik-Chevli

.DS_Store

@@ -0,0 +1,28 @@
+/* 
+In a given array of integers All the numbers are repeated twice except 1. Find the unique number.
+*/
+#include<iostream>
+#include<algorithm>
+#include<vector>
+typedef long long int ll;
+#define pb push_back
+using namespace std;
+int main()
+{
+    ll n;
+    cin>>n;
+    ll arr[n];
+    ll k;
+    for(ll i=0;i<n;i++)
+    {
+        cin>>k;
+        arr[i]=k;
+    }
+    ll xo=0;
+    for(ll i=0;i<n;i++)
+    {
+        xo^=arr[i];
+    }
+    cout<<xo<<endl;
+    return 0;
+}

Introduction to Competitive Coding(Codechef)/.DS_Store

@@ -0,0 +1,6 @@
+n=int(input())
+li=list(map(int,input().split()))
+xo=0
+for i in li:
+    xo^=i
+print(xo)    

Introduction to Competitive Coding(Codechef)/Bit Manipulation/.DS_Store

@@ -0,0 +1,36 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+#include<numeric>
+#include<functional>
+#define pb push_back;
+typedef long long int ll;
+using namespace std;
+int main()
+{
+    ll t;
+    cin>>t;
+    ll n;
+    ll k;
+    while(t--)
+    {
+        cin>>n;
+        vector<ll>v(n);
+        for(ll i=0;i<n;i++)
+        {
+            cin>>k;
+            v[i]=k;
+        }
+        ll sum=0;
+        ll xo=0;
+        for(ll i=0;i<n;i++)
+        {
+            sum+=v[i];
+            xo^=v[i];
+        }
+        //cout<<sum<<" "<<xo<<endl;
+        cout<<2<<endl;
+        cout<<xo<<" "<<xo+sum<<endl;
+    }
+    return 0;
+}

Introduction to Competitive Coding(Codechef)/Bit Manipulation/Lonely Integer/find12.cpp

@@ -0,0 +1,10 @@
+for _ in range(int(input())):
+    n=int(input())
+    li=list(map(int,input().split()))
+    su=0
+    xor=0
+    for i in li:
+        su+=i
+        xor^=i
+    print(2)
+    print(xor,su+xor)    

Introduction to Competitive Coding(Codechef)/Bit Manipulation/Lonely Integer/find12.py

@@ -0,0 +1,11 @@
+Links for Questions:
+
+**Lonely Integer**:
+https://www.hackerrank.com/challenges/lonely-integer/problem
+
+**The Great XOR**:
+https://www.hackerrank.com/challenges/the-great-xor/problem
+
+**Make Good**:
+https://codeforces.com/contest/1270/problem/C
+

Introduction to Competitive Coding(Codechef)/Bit Manipulation/Make Good/makegood.cpp

@@ -0,0 +1,30 @@
+#include<iostream>
+#include<cmath>
+#include<algorithm>
+#include<vector>
+#define pb push_back
+using namespace std;
+typedef long long int ll;
+int main()
+{
+    ll t;
+    cin>>t;
+    while(t--)
+    {
+        ll n;
+        cin>>n;
+        ll j=0;
+        ll count=0;
+        while(n)
+        {
+            if((n&1)==0)
+            {
+                count+=pow(2,j);
+            }
+            j+=1;
+            n>>=1;
+        }
+        cout<<count<<endl;
+    }
+    return 0;
+}

Introduction to Competitive Coding(Codechef)/Bit Manipulation/Make Good/makegood.py

@@ -0,0 +1,10 @@
+for _ in range(int(input())):
+    n=int(input())
+    j=0
+    count=0
+    while(n):
+        if (n&1)==0:
+            count+=(2**j)
+        j+=1
+        n>>=1
+    print(count)