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

Problems > All Inverses at Once

All Inverses at Once

Difficulty: 1600 5000 ms 128 MB

number-theory

Given a prime P and N, print the modular inverses of 1, 2, ..., N modulo P.

Input: the first line has P; the second line has N.

Output: N integers: the inverse of each i in 1..N.

Constraints:

  • 2 ≤ P ≤ 109, P prime
  • 1 ≤ N < P
  • N ≤ 106

Sample Tests

Input 1
7
5
Output 1
1 4 5 2 3
Input 2
11
1
Output 2
1

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen