Added sets and number system

algorithms/CPlusPlus/Bit manupulation/Unique.cpp

@@ -1,20 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int unique(int a[],int n){
-    int num=0;
-    for(int i=0;i<n;i++){
-        num=a[i]^num;
-    }
-    return num;
-}
-
-int main(){
-    int n;
-    cin>>n;
-    int a[n];
-    for(int i=0;i<n;i++){
-        cin>>a[i];
-    }
-    cout<<unique(a,n);
-}

algorithms/CPlusPlus/Bit manupulation/Unique2.cpp

@@ -1,35 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int unique2(int a[],int n){
-    int num=0;
-    for(int i=0;i<n;i++)
-        num=num^a[i];
-    return num;    
-}
-int getbit(int n,int num){
-    return (n&(1<<num));
-}
-
-int main(){
-    int n;
-    cin>>n;
-    int a[n];
-    for(int i=0;i<n;i++){
-        cin>>a[i];
-    }
-    int num=unique2(a,n);
-    int c=0;
-    while(c<num){
-        if(num&(1<<c))
-        break;
-        c++;
-    }
-    int n1=0;
-    for(int i=0;i<n;i++){
-        if(getbit(a[i],c))
-         n1=n1^a[i];   
-    }
-    cout<<n1<<" "<<(n1^num);
-
-}

algorithms/CPlusPlus/Bit manupulation/Unique3.cpp

@@ -1,22 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int main(){
-    int n;
-    cin>>n;
-    int a[n];
-    for(int i=0;i<n;i++)
-        cin>>a[i];
-
-    int sum=0,num=0;
-    for(int i=0;i<64;i++){
-        sum=0;
-        for(int j=0;j<n;j++){
-            if(a[j]&(1<<i))
-            sum++;
-        }
-        if(sum%3 !=0)
-        num=(num|(1<<i));
-    }
-    cout<<num;
-}

algorithms/CPlusPlus/Bit manupulation/bit_manupulation_methods.cpp

@@ -1,26 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int setbit(int n,int pos){
-    return (n|(1<<pos));
-}
-int getbit(int n,int pos){
-    return (( n &(1<<pos) )!=0);
-}
-int removebit(int n,int pos){
-    return (n &(~(1<<pos)));
-}
-int updatebit(int n,int pos,int val){
-    int a=n & (~(1<<pos));
-    return (a|(val<<pos));
-}
-
-int main(){
-    int n,p,v;
-    cin>>n>>p;
-    cout<<getbit(n,p)<<endl;
-    cout<<setbit(n,p)<<endl;
-    cout<<removebit(n,p)<<endl;
-    cin>>v;
-    cout<<updatebit(n,p,v)<<endl;
-}

algorithms/CPlusPlus/Bit manupulation/number_of_ones.cpp

@@ -1,17 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int countones(int n){
-    int count=0;
-    while(n>0){
-        n=(n&(n-1));          
-        count++;
-    }
-    return count;
-}
-
-int main(){
-    int n;
-    cin>>n;
-    cout<<countones(n);
-}

algorithms/CPlusPlus/Bit manupulation/power_of_two.cpp

@@ -1,13 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int check2power(int n){
-    
-    return ((n & (n-1))==0);
-}
-
-int main(){
-    int n;
-    cin>>n;
-    cout<<check2power(n);
-}

algorithms/CPlusPlus/Bit manupulation/subsets.cpp

@@ -1,18 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-int main(){
-    int n;
-    cin>>n;
-    int a[n];
-    for(int i=0;i<n;i++)
-        cin>>a[i];
-
-    for(int i=0;i<(1<<n);i++){
-        for(int j=0;j<n;j++){
-            if(i&(1<<j))
-                cout<<a[j]<<" ";
-        }
-        cout<<endl;
-    }
-}