k, a, b = map(int, input().split())
ans = 0
r = a % k
if r == 0 :
start_ind = a
else :
start_ind = a + k - r
ans = (b - start_ind) // k
print(ans + 1)#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <unordered_map>
#include <math.h>
#include <iomanip>
typedef long long ll;
void solve() {
ll k, a, b;
std::cin >> k >> a >> b;
ll first_num = a / k * k;
if (first_num < a) {
first_num += k;
}
ll last_num = b / k * k;
if (last_num > b) {
last_num -= k;
}
ll i = first_num / k;
ll j = last_num / k;
ll answer = j - i + 1;
std::cout << answer << std::endl;
}
int main() {
solve();
} 405A - Gravity Flip | 499B - Lecture |
709A - Juicer | 1358C - Celex Update |
1466B - Last minute enhancements | 450B - Jzzhu and Sequences |
1582C - Grandma Capa Knits a Scarf | 492A - Vanya and Cubes |
217A - Ice Skating | 270A - Fancy Fence |
181A - Series of Crimes | 1638A - Reverse |
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |