Nikhil and his candies

CodeChefOpen on judge ↗

Nikhil likes the number p alot. He want to buy only one chocolate and only one candy. Each candy and chocolate has a number associated with it. He will only buy a pair of chocolate and candy if the sum of numbers associated with them equals p. He is wondering, how many pairs he has to choose from ? Since Nikhil is busy in his placement season. Can you help him out? Input The first line contains

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