Back To Childhood

CodeChefOpen on judge ↗

In your childhood you would have studied the famous BODMAS rule. So try to use it here. ###Input: - First line contains an integer $T$ denoting number of test cases. Each test case contains of string s, consisting of only ‘/’ and ‘*’. ###Output: Print a single line for each test, either “Regular since Childhood.” or “Irregular since Childhood.” (without quotes). ###Constraints - $1 \leq T \l

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