ICPC Preparation
CodeChefOpen on judge ↗
It's ICPC season! Rishi and Himanshu are preparing for ACM ICPC. Now Subbareddy sir being ICPC coach wants to check their progress, so he wants them to solve the following problem. Subba Reddy gives them a directory of words which contains N words. Later he asks them Q queries containing two integers L and R, where L and R are indices (1-indexed). Rishi and Himanshu need to find the number of di
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.
Sign in to chat with the tutor and save your progress.
Sign in to start