← All problemsSign in

Cross Sequence

The new budding programmers are playing pivot game & the task is to display pivot to 0 values followed by moving the control to the end value N. The rule here is that there must be only non-negative values in the row. ###Input: - First line of input, the integer $S$. - Second line of input, the integer $N$. ###Output: - Until $N$ values. ###Constraints - $0 \leq S \leq 100$ - $1 \leq N \leq 1

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