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 > Find a Primitive Root

Find a Primitive Root

Difficulty: 2300 4000 ms 128 MB

number-theory

Print the SMALLEST primitive root modulo prime P — the smallest g whose powers generate every non-zero residue.

Input: one integer P (prime).

Output: the smallest primitive root.

Constraints:

  • 2 ≤ P ≤ 107, P prime

Sample Tests

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