← All problemsSign in

Sequence Search

CodeChefRating 2204Open on judge ↗

A sequence $X$ is defined as: - $X_1 = 0;$ - $X_2 = A;$ - $X_3 = B;$ - $X_i$ = $X_{i-1} + X_{i-2} - X_{i-3}$ for all $i > 3$. Given an integer $K$, find the $K^{th}$ **smallest** element of sequence $X$. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of three space-separated integers $A$, $B$, and $K$, as ment

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

Sign in to chat with the tutor and save your progress.

Sign in to start