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 > Modular Inverse

Modular Inverse

Difficulty: 1500 2000 ms 128 MB

math

Print the modular inverse of A modulo the prime 109+7 — the unique X in [1, 109+6] with A·X ≡ 1.

Input: one integer A.

Output: the inverse of A mod 109+7.

Constraints:

  • 1 ≤ A ≤ 109+6

Sample Tests

Input 1
2
Output 1
500000004
Input 2
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