Tie Breaker

CodeChefOpen on judge ↗

$Tanuj$ is a very $mischievous$ student. He $never$ listens to his $mathematics$ $teacher$. So, One day his $mathematics$ $teacher$ caught him talking to his bench mate and not listening to his lecture. Today he is in the $mood$ to teach $Tanuj$ a lesson So, he gave $Tanuj$ an array of positive integers $Arr[]$ and assign a $task$ for him. $Tanuj's$ job is to find the $number$ $of$ $ways$ in whi

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