Solving Days
CodeChefOpen on judge ↗
Chef is having trouble cooking and solving problems simultaneously. Thus, he decides to solve problems only on some special days called *Solving days*. To decide if a given day is a *Solving day* or not, he follows a particular algorithm. Suppose a particular date has day $D$, month $M$ and year $Y$**(all without leading zeros)**. He defines $length\_of\_date$ as the total number of digits in
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