Preparando MOJI

Divisibility

1000ms 262144K

Description:

Find the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer values x that a ≤ x ≤ b and x is divisible by k.

Input:

The only line contains three space-separated integers k, a and b (1 ≤ k ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).

Output:

Print the required number.

Sample Input:

1 1 10

Sample Output:

10

Sample Input:

2 -4 4

Sample Output:

5

Informação

Codeforces

Provedor Codeforces

Código CF597A

Tags

math

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:01:47

Relacionados

Nada ainda