A Fixed Remainder
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
Discussion (opens after you solve — no spoilers before)
No comments yet.