← All problemsSign in

No sequence

CodeChefRating 2031Open on judge ↗

Alice gave Bob $3$ integers $N, K,$ and $S$. Help Bob find an $S$-good sequence. A sequence $B$ of length $N$ is called $S$-good if the following conditions are met: - $B_i \in \{-1, 0, 1\}$ for each $1 \leq i \leq N$ - $\sum_{i=1}^N B_i\cdot K^{i-1} = S$ If there are multiple $S$-good sequences, print **any** of them. **If no $S$-good sequence exists, print $-2$.** ### Input - The first line

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