Squared Subsequences
CodeChefOpen on judge ↗
Let's call a sequence of integers *good* if the product of its elements can be represented as a difference of squares of two integers. More formally, a sequence $S_1, S_2, \ldots, S_K$ is *good* if it is possible to find two integers $p$ and $q$ such that $S_1 \cdot S_2 \cdot \ldots \cdot S_K = p^2 - q^2$. Chef has a sequence $A_1, A_2, \ldots, A_N$. He wants to find the number of contiguous su
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.
Sign in to chat with the tutor and save your progress.
Sign in to start