Possible or not || CodeChef Starters 94 Solution with Explanation

[@anmolthind9646]

Great work thanks alot bhaiya app itni easily explain kar dete hai tough question bi

[@learn_to_code10]

Thanks 🌹

[@thesoftwareguy2183]

From where you have learn about SuperMask property ???

[@md.asrafulhasan8217]

tnx bro for this new trick.

[@thesoftwareguy2183]

Its Damn easy !!
Thankyou So much !!
From where you have learn about SuperMask property ???

[@learn_to_code10]

Geeks for geeks Bitmasking or you can also search bit tricks for cp😁

[@ekanshsharma1309]

bhaiya bohot achha explaination tha. Please keep continue these type of question. Xor bitwise waale questions samjh nhi aate. Please suggest some material

[@pranavmittal2976]

bro your explaination is just fabulous have no words ......☺☺☺

[@learn_to_code10]

So nice of you

[@thumatibhavani9375]

What's the binary value for -1(negative 1)

[@thesoftwareguy2183]

@@thumatibhavani9375 1111111111111111

[@Name-p1x]

Can you pls post other question solutions also

[@RaviRaj-xq7sv]

bro subsequence too 1 size ka bhi ho sakta ha too jab ek element mil gaya fhir kyu check krna

[@vinayaksharma7134]

❤❤

[@atulyakumariit-indore2908]

great explanation.... but i had a doubt... wo and =-1 waala part samajh nai aaya and baadme hum and ke saath a[i] ka & kyu kar rahe hai?

[@learn_to_code10]

Now, let's break down the code:
int And = -1;: The variable And is initialized to -1. In binary representation, -1 is all 1s (in two's complement form). This is done because we are going to use And to compute the bitwise AND of certain numbers. Initializing it to -1 ensures that the first bitwise AND operation does not change the result.
if((a[i] & k) == k): Here, the code is checking if a[i] is a supermask of k. It's using the property of bitwise AND that if x & y = y, then x is a supermask of y. If this condition is true, then a[i] is a supermask of k.
And &= a[i];: If a[i] is a supermask of k, the code computes the bitwise AND of And and a[i] and stores the result back in And. It's trying to keep track of the bitwise AND of all supermasks of k in the array.
if(And == k): At the end, if the bitwise AND of all supermasks is k, it means there's a subsequence whose bitwise AND equals k, so it prints "YES". Otherwise, it prints "NO".
In summary, And = -1; is used to initialize And in such a way that the first bitwise AND operation with it doesn't affect the result. And And &= a[i]; is used to compute the bitwise AND of all supermasks of k.

[@atulyakumariit-indore2908]

@@learn_to_code10 oooh thank you for your efforts...i understood now...btw do you have any telegram channel...so that you dont need to type that all and just simply can send a voice note.

[@RAMKUMAR-eb1kq]

do it in english bro

[@atulyakumariit-indore2908]

suscriber++;

[@thumatibhavani9375]

Bro please explain in english too

[@learn_to_code10]

You do not know hindi?

[@thumatibhavani9375]

Yes I don't know I am from telugu state..can you tell me the binary value for -1

[@learn_to_code10]

@@thumatibhavani9375 Now, let's break down the code:
int And = -1;: The variable And is initialized to -1. In binary representation, -1 is all 1s (in two's complement form). This is done because we are going to use And to compute the bitwise AND of certain numbers. Initializing it to -1 ensures that the first bitwise AND operation does not change the result.
if((a[i] & k) == k): Here, the code is checking if a[i] is a supermask of k. It's using the property of bitwise AND that if x & y = y, then x is a supermask of y. If this condition is true, then a[i] is a supermask of k.
And &= a[i];: If a[i] is a supermask of k, the code computes the bitwise AND of And and a[i] and stores the result back in And. It's trying to keep track of the bitwise AND of all supermasks of k in the array.
if(And == k): At the end, if the bitwise AND of all supermasks is k, it means there's a subsequence whose bitwise AND equals k, so it prints "YES". Otherwise, it prints "NO".
In summary, And = -1; is used to initialize And in such a way that the first bitwise AND operation with it doesn't affect the result. And And &= a[i]; is used to compute the bitwise AND of all supermasks of k.
I think after reading this you will understand