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 > A Fixed Remainder

A Fixed Remainder

Difficulty: 1100 2000 ms 128 MB

math

How many integers x in [1, N] satisfy x mod A = B?

Input: one line with three integers N, A, B.

Output: the count (0 when B ≥ A).

Constraints:

  • 1 ≤ N ≤ 1018
  • 1 ≤ A ≤ 1018
  • 0 ≤ B ≤ 1018

Sample Tests

Input 1
10 3 1
Output 1
4
Input 2
10 3 0
Output 2
3

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