← All problemsSign in

Chef and Periodic Sequence

Let's define a periodic infinite sequence $S$ ($0$-indexed) with period $K$ using the formula $S_i = (i \% K) + 1$. Chef has found a sequence of positive integers $A$ with length $N$ buried underground. He suspects that it is a contiguous subsequence of some periodic sequence. Unfortunately, some elements of $A$ are unreadable. Can you tell Chef the longest possible period $K$ of an infinite peri

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