Starring the unknowns

CodeChefOpen on judge ↗

At BITS Pilani, Goa Campus there was a conference on coding and cryptography during Quark. The following theorem needed a proof or a counterexample: Suppose we are given a set of words of equal length; each word consisting of 0's, 1's and/or *'s. Also suppose that the pattern of *'s is different for all words in the set. The claim is: if you the *'s are replaced by 0's and 1's in all possible way

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI