Candies on the Step

CodeChefOpen on judge ↗

PROBLEM DESCRIPTION There are steps numbered from 0 to n-1 (both inclusive). There are some candies on each step. Rahul collects candies from steps which are odd indexed and Gaurav from even indexed. Your task is to print the number of candies Rahul and Gaurav collected. Input - The first line of the input contains an integer T denoting the number of test cases. - Next line contains an integer

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