← All problemsSign in

Champak and Clocks

Champak is a bright student who is very fond of clocks. He comes across a puzzle which states that he needs to calculate the number of times the minute hand and hour hand of a clock will make a $90^o$ degrees angle between them. He is given $T$ such queries with time range from $L$ hours to $R$ hours (**both inclusive** in the $24$-hour format) like $[L,R]$. He has to count the number of

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

Sign in to chat with the tutor and save your progress.

Sign in to start