LINEAR TRANSFORMATIONS

CodeChefOpen on judge ↗

N people, standing in a circle, numbered 0 to N-1, play a game. There is a machine in the center of this circle, configured with a number M, and N coefficients b_0, ...b_{N-1}. Further, initially, each person has a number with him: a_i. This game is played as follows. In each round, all N players input into the machine, the number that they have (initially a_i). Given the inputs a_i from all th

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