Yet Another Sequence

CodeChefOpen on judge ↗

You are given the first N terms of a sequence. The remaining terms of the sequence are defined as follows: A [ i ] = number of j such that 0 ≤ j The sequence is indexed starting at 0. The first N terms of the sequence will each be equal to N-1, N, or N+1. In addition to the first terms of the sequence, you will be given a number of queries. For each query you are to calculate the value of the se

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