← All problemsSign in

Zero sum game

Chef is given numbers $n_1$ and $n_2$. He plays the zero-sum game. In this game, the sum of numbers $n_1$ and $n_2$ is called $n_3$, which gives his number of points. Further if $n_1 + n_2 = n_3$ holds after removing the zeros, then he doubles his points. But if it doesn't hold he loses all of his points. Print the number of points Chef gets in each case. ###Input - $T$ the number of test

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