Pinocchio and Lampwick - Part 2
CodeChefOpen on judge ↗
After confronting Pinocchio, Lampwick decided to further analyse his diary about Pinocchio. (You can find the details about the diary in Part 1 of this problem) Now he needs to find out the maximum number of days that passed by in which Pinocchio surely didn't lie. Can you help him out? Input First line of input contains T, the number of test cases. For each of the next T lines, two lines
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