Sum of Cube
You are given an array $A$ consisting of $N$ positive integers. Find $\sum_{i=1}^{N} \sum_{j=i}^{N} F^3(i,j)$, where $F(i,j)=\sum_{k=i}^{j} A_k$. Since the value might be quite large, print it modulo $998244353$. ### Input - The first line of input contains a single integer $T$, denoting the number of test cases. - Each test case consists of two lines of input. - The first line of each test
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