597A.md (682B)
1 Source: https://codeforces.com/problemset/problem/597/A 2 3 A. Divisibility 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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*. 22 23 Input 24 25 The only line contains three space-separated integers *k*, *a* and *b* (1 ≤ *k* ≤ 1018; - 1018 ≤ *a* ≤ *b* ≤ 1018). 26 27 Output 28 29 Print the required number. 30 31 Examples 32 33 Input 34 35 ``` 36 1 1 10 37 ``` 38 39 Output 40 41 ``` 42 10 43 ``` 44 45 Input 46 47 ``` 48 2 -4 4 49 ``` 50 51 Output 52 53 ``` 54 5 55 ```