Unique Number-III, Hackerblocks, Bitmasking

lohithsaiandra18 · July 30, 2019, 12:59am

Sir how u are able to figure out that logic. Please explain about main intention of the logic.

apaarkamal · July 30, 2019, 4:32am

all those numbers will contribute a given bit 3 times and the special number will contribute it for 1 time only.
so take the sum of ith set bits off all numbers , now see whether sum is 3n or 3n+1, thats your answer

lohithsaiandra18 · July 30, 2019, 7:05am

I didn’t understand problem solution properly kindly please elaborate sir.

apaarkamal · July 30, 2019, 8:03am

github.com

apaarkamal/launchpad_summer_2k19/blob/master/08. bitmasking/unique number 3.cpp

#include<bits/stdc++.h>

using namespace std;

const int M=31;

int32_t main()
{
    // int t;cin>>t;while(t--)
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    {
        int i,j,k,n,m,ans=0,cnt=0,sum=0;
        cin>>n;
        int total_sum[32];
        int a[n];
        for(i=0;i<n;i++){
         	cin>>a[i];

This file has been truncated. show original

try to understand it