Six and Nine
CodeChefOpen on judge ↗
Chef Ciel is fascinated about the numbers $6$ and $9$. He is giving you a task to find out the first $K$ common multiples of $6$ and $9$. To make this task more interesting, he wants you to print a string of $1$’s whose length is equal to the number of $6$’s and $9$’s present in those $K$ common multiples. Print $0$ if no $6$ and $9$ exist. ### Input First line will contain $T$, number of testcas
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.
Sign in to chat with the tutor and save your progress.
Sign in to start