EAZYE

CodeChefOpen on judge ↗

You are given a polynomial $r(x)$ of degree $m$ and 3 numbers $n,a,d$. You need to evaluate $r(x)$ mod $p$ at $a,a+d,....,a+(n-1)d.$ Take $p=998244353$ --- ###Input format: - The first line contains the numbers $n,m,a,d$. - The second line contains $m+1$ numbers with the $i^{th}$ number being the coefficient of $x^i$ in $r(x)$. --- ###Output format: - Print the required $n$ non

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