Score Sum
For an array $B$ of length $M$, suppose $F(B) = \sum_{i=1}^{M-1} (-1)^{i+1} {|B_i - B_{i+1}|}^7$. You are given an array $A$ of length $N$. Find the **sum** of $F(S)$ over all non-empty [subsequences](https://en.wikipedia.org/wiki/Subsequence) $S$ of $A$. Since the sum might be too large, please print it modulo $998244353$. ### Input - The first line of input contains a single integer $T$, deno
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