All Inverses at Once — Solution & Editorial | Jobs at Avian IT

Hiring process8 levels

1 IQ Test
2 Additional Online Test (If Required)
3 Office Interview with Hiring Manager
4 Unpaid Test Task (Motivation Check)
5 Paid Test Task and Follow-Up Interview
6 Iterative Paid Test Tasks
7 Office Verification
8 Final Interview with the Founder

Problems > All Inverses at Once > Editorial

All Inverses at Once — Solution & Editorial

Back to the Problem

Linear recurrence inv[i] = −⌊P/i⌋·inv[P mod i] mod P computes all inverses in O(N) — far faster than N separate Fermat exponentiations.

Complexity: O(N)

Watch out: The recurrence, not N modular exponentiations, is the point — the latter is O(N log P).