Problem:
 Score : 200 points    Problem Statement You are given nonnegative integers a and b ( a ≤ b ), and a positive integer x .
Among the integers between a and b , inclusive, how many are divisible by x ?      Constraints  0 ≤ a ≤ b ≤ 10^{18}  1 ≤ x ≤ 10^{18}         Input The input is given from Standard Input in the following format:  a  b  x       Output Print the number of the integers between a and b , inclusive, that are divisible by x .        Sample Input 1 4 8 2      Sample Output 1 3  There are three integers between 4 and 8 , inclusive, that are divisible by 2 : 4 , 6 and 8 .       Sample Input 2 0 5 1      Sample Output 2 6  There are six integers between 0 and 5 , inclusive, that are divisible by 1 : 0 , 1 , 2 , 3 , 4 and 5 .       Sample Input 3 9 9 2      Sample Output 3 0  There are no integer between 9 and 9 , inclusive, that is divisible by 2 .       Sample Input 4 1 1000000000000000000 3      Sample Output 4 333333333333333333  Watch out for integer overflows.

Solution (Python):
import collections
 

def inputStrOnebyOne():
    s = list(input())
    return s
 

def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a
 
def main():
    a, b, x = map(int, input().split())
    print(b//x-((a-1)//x))
 
if __name__=='__main__':
    main()

Solution (Python):
a,b,x = map(int,input().split())

print(b//x-(a-1)//x)

Solution (Python):
a, b, x = map(int,  input().split())

ans = (b // x) - (a // x)

if a % x == 0:
    ans +=1

print(ans)

Solution (Python):
a,b,x = map(int,input().split())
print(b//x-((a-1)//x))

Solution (Python):
def resolve():
    '''
    code here
    '''
    a, b, x = [int(item) for item in input().split()]
    _a = a // x
    _b = b // x

    if a % x == 0:
        res = _b - _a + 1
    else:
        res = _b - _a
    
    print(res)



if __name__ == "__main__":
    resolve()

Solution (Python):
a,b,x = map(int,input().split())
ans = 0
ad = a//x*x
bd = b//x*x
if ad == a:
  ans += 1
ans += (bd - ad) // x
print(ans)

Solution (Python):
def resolve():
    
    
    
    a, b, x = map(int, input().split())
    
    
    
    
    
    

    if a % x == 0:
        nmin = int(a / x)
    else:
        nmin = (a // x) + 1

    nmax = b // x

    print(nmax - nmin +1)


resolve()

Solution (Python):
a, b, x = map(int, input().split(" "))
res = b // x + (1 if a == 0 else -((a - 1) // x))
print(res)

Solution (Python):
a,b,x=map(int,input().split())
t1 = (a-1)//x
t2 = b//x
res = t2-t1
print(res)

Solution (Python):
import sys

import math
from fractions import Fraction
import itertools

input=sys.stdin.readline

a,b,x=map(int,input().split())
ans=b//x-(a-1)//x
print(ans)

Solution (Python):

import sys


def solve(a: int, b: int, x: int):
    if a % x == 0:
        print(int((b - a) // x + 1))
        return
    next = (x - a % x) + a
    if next > b:
        print(0)
        return
    v = (b - next) // x
    print(v + 1)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    x = int(next(tokens))  
    solve(a, b, x)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, x = list(map(int, input().split()))
def num_dev(n, x):
    if n == -1: return 0
    return n // x + 1
print(num_dev(b, x) - num_dev(a - 1, x))

Solution (Python):
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





a,b,x = IL()

P(b//x-(a-1)//x)

Solution (Python):
a, b, x = [int(i) for i in input().split()]
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split(" "))
ans = b//x - (a - 1)//x

print(ans)

Solution (Python):
a, b, x = map(int, input().split())

count = 0
n = a % x
if (n == 0):
    c = a
else:
    c = a + (x - n)   

if (c <= b):
    count += ((b - c) // x) + 1

print(count)

Solution (Python):


a, b, x = map(int, input().split())

b_r = b // x

if a != 0:
    a_r = (a - 1) // x
    print(b_r - a_r)
else:
    print(b_r + 1)

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    a,b,x=map(int,input().split())
    print(b//x-(a-1)//x)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, x = map(int, input().split())
A = b//x
B = a//x
if a%x == 0:
    print(A-B+1)
else:
    print(A-B)

Solution (Python):
a, b, x = map(int, input().split())

low = (a-1) // x
up = b // x

print(up-low)

Solution (Python):
a,b,x=(int(x) for x in input().split())

if a==0:
    print(1+b//x)
else:
    c=b//x-(a-1)//x
    print(c)

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, x = mi()
    if a == 0:
        print(b // x + 1)
    else:
        print(b // x - (a - 1) // x)


if __name__ == "__main__":
    main()

Solution (Python):
A, B, X = map(int, input().split())
































print((B//X) - ((A-1)//X))

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int,input().split())
















result = 0

a_x = divmod(a,x)  

if a_x[1]==0:  
    first = a
else:  
    first = x * (a_x[0]+1)
    first2 = a + (x - a_x[1])  


b_x = divmod(b-first, x)

result = b_x[0]+1

print(result)






"""
名答だと思ったがだめだった

count = 0
first = 0
for i in range(a, b+1):

    if i%x == 0:
        first = i
        count = 1
        break
    
if count != 0:
    result  = (b-first) // x +1

else :
    result = 0


print(result)



"""

Solution (Python):
a,b,x = map(int,input().split())

ans = b//x - (a-1)//x 
print(ans)

Solution (Python):
a,b,x=map(int,input().split())
start=((a-1)//x+1)*x
if start>b:
    print(0)
else:
    print((b-start)//x+1)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())

print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)

Solution (Python):
a,b,x = map(int,input().split())
a_n = a // x
a_p = a % x
b_n = b // x

ans = b_n - a_n
if a_p == 0:
  print(ans+1)
else:
  print(ans)

Solution (Python):
a,b,x = map(int,input().split())
a_n = a // x
a_p = a % x
b_n = b // x

ans = b_n - a_n
if a_p == 0:
  print(ans+1)
else:
  print(ans)

Solution (Python):
a, b, x = map(int, input().split())

def f(n):
    if n == -1:
        return 0
    else:
        return n//x + 1
print(f(b) - f(a-1))

Solution (Python):
a, b, x = map(int, input().split())
if a%x == 0:
    print((b//x+1) - (a//x))
else:
    print((b//x+1) - (a//x+1))

Solution (Python):
import sys

a, b, x = map(int, sys.stdin.readline().strip().split())
print(b // x - (a - 1) // x)

Solution (Python):
import sys

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline
    a,b,x=map(int, readline().rstrip().split())
    print(b//x - (a-1)//x)
    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    a,b,x=map(int, readline().rstrip().split())
    if a%x==0:
        f=a
    else:
        f=a-a%x+x
        if f > b:
            print(0)
            return
    if b%x==0:
        t=b
    else:
        t=b-b%x
        if t<a:
            print(0)
            return
    print((t-f)//x+1)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
a, b, x = map(int, input().split())

print((b // x) - ((a - 1)// x))

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    a, b, x = map(int, readline().split())
    ans = b//x - (a-1)//x
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, x = map(int, input().split())

if a % x != 0 :
    aa = a//x+1
else :
    aa = a//x


bb = b //x

print(bb - aa  + 1 )

Solution (Python):
a,b,x = map(int,input().split())
if a%x==0 or a==0:
    print((b//x)-(a//x)+1)
else:
    print((b//x)-(a//x))

Solution (Python):
a,b,c=map(int,input().split())
def f(x,c):
    if x==-1:
        return 0
    else:
        return x//c+1
print(f(b,c)-f(a-1,c))

Solution (Python):
a,b,x = map(int,input().split())
tmp = b//x - a//x
if a%x == 0:
    tmp += 1

print(tmp)

Solution (Python):
def cin():
	return map(int,input().split())

def cino(test=False):
    if not test:
        return int(input())
    else:
        return input()
def cina():
  return list(map(int,input().split()))

def ssplit():
    return list(input().split())


import math
a,b,c = cin()
print(b//c - a//c+(a%c==0))

Solution (Python):
a,b,x = map(int, input().split())
 
print(b//x-(a-1)//x)

Solution (Python):
a,b,x = map(int, input().split())

print(b//x-(a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x-(a-1)//x)

Solution (Python):
A,B,X=map(int,input().split())

ans=0

if A!=B:
    ans+=1*(A%X==0)
    ans+=(B-A+A%X)//X
else:
    ans+=1*(A%X==0)

print(ans)

Solution (Python):
a, b, x = map(int, input().split(' '))

print(b // x - (a - 1) // x)

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]

from collections import defaultdict, deque
from sys import exit
import heapq
import math
import copy
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)

a, b, x = getNM()
print(b // x - (a - 1) // x)

Solution (Python):




a,b,x=map(int,input().split())




if a==0:
    print((b//x)+1)
else:
    print((b//x)+1-(((a-1)//x)+1))

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-((a-1)//x))

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - ~-a // x)

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - (a - 1) // x)

Solution (Python):
def main():
  a, b, x = map(int, input().split())
  print(b//x-(a-1)//x)
if __name__ == "__main__":
  main()

Solution (Python):
a, b, x = map(int,input().split())
print(-a//x+ b//x+1)

Solution (Python):
a, b, x = [int(i) for i in input().split()]

def ret(n):
    if n>=0:
        return n//x+1
    else:
        return 0
print(ret(b)-ret(a-1))

Solution (Python):
a,b,x = map(int,input().split())
def ret(n):
    if n>=0:
        return n//x+1
    else:
        return 0
print(ret(b)-ret(a-1))

Solution (Python):
a, b, x = map(int, input().split())

ans = b//x - (a-1)//x

print(ans)

Solution (Python):
a, b, x = map(int, input().split())

a_div = a // x
b_div = b // x

if a % x == 0:
    print(b_div-a_div+1)
else:
    print(b_div - a_div)

Solution (Python):
import sys
import math
import bisect

def query(n, x):
    return n // x + 1

def main():
    a, b, x = map(int, input().split())
    ans = query(b, x)
    if a > 0:
        ans -= query(a - 1, x)
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
a,b,x = map(int,input().split())
fisrt = 0
if a%x == 0:
    first  = a//x
else:
    first = a//x +1
    
last = b//x
print(last - first + 1)

Solution (Python):
a,b,x = map(int,input().split())

total_b = b//x
total_a = (a-1)//x

print(total_b - total_a)

Solution (Python):

a,b,x=map(int, input().split())
m=b//x
n=(a-1)//x
print(m-n)

Solution (Python):

a, b, x = map(int, input().split())
print(b//x-(a-1)//x)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
a, b, x = MAP()


print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
a = (a - 1) // x
b = b // x
print(b - a)

Solution (Python):
import math
a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b, x = map(int, read().split())
print(b // x - (a - 1) // x)

Solution (Python):
a,b,x = map(int, input().split())
hoge = b//x - a//x
if a%x == 0:
    hoge += 1
print(hoge)

Solution (Python):
A, B, X = map(int, input().split())

ans=(B//X) - ((A-1)//X)

print(ans)

Solution (Python):
a,b,x = map(int,input().split())
d = b//x
if a%x == 0:
  e = a//x
else:
  e = a//x + 1
print(d-e+1)

Solution (Python):
a,b,x = map(int,input().split())

print(b//x-(a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())

if a % x == 0:
  if b % x == 0:
    print(b // x - a // x + 1)
  else:
    print(b // x - a // x + 1)
else:
  if b % x == 0:
    print(b // x - a // x)
  else:
    print(b // x - a // x)

Solution (Python):
a,b,x = map(int,input().split())
print((b//x)-((a-1)//x))

Solution (Python):
import math
from decimal import *
a, b, x = map(int, input().split(" "))
print(math.floor(Decimal(b)/Decimal(x)) - math.ceil(Decimal(a)/Decimal(x)) + 1)

Solution (Python):
def main():
    a, b, x = map(int, input().split())
    atmp = (a-1)//x
    btmp = b//x
    ans = btmp - atmp
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
a, b, x = map(int, input().split())
print( b//x - (a-1)//x)

Solution (Python):
a, b, x = map( int, input().split())
 
print( b//x - (a-1)//x)

Solution (Python):
a,b,x = map(int,input().split())
ans = 0




def f(n):
    count = 0
    if n == -1:
        return 0
    else:
        count = n//x + 1 
        
        return count

ans = f(b)-f(a-1)

print(ans)

Solution (Python):


a, b, x = map(int, input().split())
print(b // x - a // x + (1 if a % x == 0 else 0))

Solution (Python):
a,b,x = map(int,input().split())
print( b//x -(a-1)//x )

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

a,b,x = map(int,input().split())
if a == 0:
    ans = b//x + 1
else:
    ans = b//x - (a-1)//x
print(ans)

Solution (Python):
a, b, x = map( int, input().split())

print( b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
b //= x
a = (a - 1) // x
print(b - a)

Solution (Python):
a,b,x = map(int,input().split())
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = list(map(int, input().split()))
ans = (b // x) - (a // x)
if a % x == 0: ans += 1
print(ans)

Solution (Python):
a, b, x = map(int, input().split())

mod = a % x
if mod == 0:
  start = a-(x-1)
else:
  start = a-(mod-1)
print((b-start+1)//x)

Solution (Python):
a, b, x = map(int, input().split())
a -= 1
print(b // x - a // x)

Solution (Python):
from sys import stdin


def ceil(a,b):
    return (a+b-1)//b


def floor(a,b):
    return a//b


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    a,b,x = list(map(int,_in[0].split(' ')))  
    
    cnt = floor(b,x)-ceil(a,x)+1
    
    print(cnt)

Solution (Python):
import sys
input = sys.stdin.readline
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
import sys
input = sys.stdin.readline
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
import numpy as np
import functools
import math
import scipy
import fractions
import itertools

def solve():
    a, b, x = map(int, input().split())
    hoge = b // x
    huga = (a-1) // x
    print(hoge-huga)
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
a,b,x = list(map(int, input().split()))

print(b//x - (a-1)//x)

Solution (Python):
a,b,x=map(int,input().split())
aw=a//x
bw=b//x
ans=bw-aw

if a%x==0:
    ans+=1

print(ans)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x-(a-1)//x)

Solution (Python):
a,b,x = map(int,input().split())

a += (x - a%x) if a%x else 0
b -= b%x

ans = b//x - a//x + 1
print(ans)

Solution (Python):
a,b,x = map(int,input().split())
ans = 0
if a%x==0:
    ans = (b-a)//x+1
else:
    c = (a//x+1)*x
    ans = (b-c)//x+1
print(ans)

Solution (Python):
a,b,x = map(int,input().split())

a = -(-a//x)
b = b//x

print(b-a+1)

Solution (Python):
a,b,x = map(int,input().split())
print(b//x - (a-1)//x)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7


a,b,x=MI()
ans=b//x-(a-1)//x
print(ans)

Solution (Python):
a, b, x = map(int, input().split())


print(b // x - (a - 1) // x if a - 1 >= 0 else b // x - a // x + 1)

Solution (Python):
A,B,C = map(int,input().split())
ans = 0
ans += B // C
ans -= (A-1) // C
print(ans)

Solution (Python):
import math
a, b, x = map(int, input().split())

xa = -(-a // x)
xb = b // x
print(xb - xa + 1)

Solution (Python):
import sys

input = sys.stdin.readline

def main():
    ans = 0
    a, b, x = map(int, input().split())
    a -= 1
    la = a//x
    lb = b//x
    ans = lb - la
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)

Solution (Python):
a,b,x=input().split()
a,b,x=int(a),int(b),int(x)

n=(b-a+1)//x

left = (x-a%x)%x

if left +n*x<(b-a+1):
    n+=1
print(n)

Solution (Python):
a,b,x = map(int,input().split())
if a%x != 0:
  print(b//x-a//x)
else:
  print(b//x-a//x+1)

Solution (Python):
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


a, b, x = readnums()

s = a + x - a % x if a % x else a
if s > b:
    ans = 0
else:
    ans = b // x - s // x + 1

print(ans)

Solution (Python):
a,b,n = map(int,input().split())
print(b//n-(a-1)//n)

Solution (Python):
a, b, x = map(int, input().split())
m = x * ((a-1)//x + 1)
print(max(0,(b-m)//x+1))

Solution (Python):
a,b,x=map(int,input().split())
print(b//x - a//x +1 if a%x==0 else b//x - a//x)

Solution (Python):
a,b,x=map(int,input().split())
shita=a//x
ue=b//x
if a%x==0:
  print(ue-shita+1)
else:
  print(ue-shita)

Solution (Python):
a,b,x=map(int,input().split())
ans=b//x-a//x
if a%x==0:
  ans+=1
print(ans)

Solution (Python):
a,b,x=map(int,input().split())

X=(b-b%x)
if a>X:
    print(0)
else:
    print(1+(X-a)//x)

Solution (Python):

import collections
import itertools as it
import math

 


a, b, x  = map(int, input().split())





ans = b // x - a // x
ans += 1 if a % x == 0 else 0

print(ans)

Solution (Python):

a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):


a, b, x = map(int, input().split())



print(b//x - (a-1)//x)

Solution (Python):
A, B, X = [int(x) for x in input().split()]
print(B//X-(A-1)//X)

Solution (Python):
a,b,x=map(int,input().split())
newb=b//x
newa=a//x
amari=a%x
ans=newb-newa
if amari==0:
    ans+=1
print(ans)

Solution (Python):




a, b, x = map(int,input().split())


wk_v1 = (a - 1) // x
wk_v2 = b // x
ans = wk_v2 - wk_v1


print(ans)

Solution (Python):

import sys
input = sys.stdin.readline









A,B,X = map(int,input().split())

print(B//X - (A-1)//X)

Solution (Python):
a,b,x = map(int, input().split())

print(b//x-(a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
if a%x == 0:
  print(b//x - a//x + 1)
else:
  print(b//x - a//x)

Solution (Python):
a, b, x = map(int, input().split())
print(b // x - (a // x + int(a % x != 0)) + 1)

Solution (Python):
def resolve():
    a, b, x = list(map(int, input().split()))
    print((b//x)-((a-1)//x))
    

if '__main__' == __name__:
    resolve()

Solution (Python):
a,b,x=map(int, input().split())

Ans = (b//x)-((a-1)//x)
print(Ans)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x-(a-1)//x)

Solution (Python):
import sys
input = sys.stdin.readline


def read():
    a, b, x = map(int, input().strip().split())
    return a, b, x

def solve(a, b, x):
    return b // x - (a-1) // x

if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

Solution (Python):
a, b, x = map(int,input().split())
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = [int(x) for x in input().split()]

print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())


if a == 0:
    count_a = 0
else:
    count_a = (a-1) // x + 1



count_b = b // x + 1

print(count_b - count_a)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
a,b,x = map(int,input().split())
result = b//x - a//x
if a%x == 0:
	result +=1
    
print(result)

Solution (Python):
a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())

bb = b // x
aa = (a - 1) // x

if a == 0:
  print(bb+1)
else:
  print(bb-aa)

Solution (Python):
a, b, c = map(int, input().split())

print(b // c - (a-1) // c)

Solution (Python):
a,b,x=map(int,input().split());print(b//x-(a-1)//x)

Solution (Python):
a,b,x=map(int,input().split())
a1=a//x
if a%x==0:
  a1-=1
b1=b//x
print(b1-a1)

Solution (Python):
a,b,x=map(int, input().split())
print(b//x-(a-1)//x)

Solution (Python):
a,b,x=map(int, input().split())
print(b//x-((a-1)//x+1)+1)

Solution (Python):
a,b,x = map(int,input().rstrip().split(" "))

p = b // x - a // x
if a % x == 0:
    p += 1
print(p)

Solution (Python):
a, b, x = map(int, input().split())

print(b // x - a // x + (1 if a % x == 0 else 0))

Solution (Python):
def main():
    a,b,x = map(int,input().split(" "))
    x = b//x - (a-1)//x
    print(x)
main()

Solution (Python):
a, b, x = map(int, input().split())

cnt = b // x + 1
if a == 0:
    print(cnt)
else:
    print(cnt - ((a - 1) // x + 1))

Solution (Python):
def sol(x,m):
	if x<=0:
		return 0
	else:
		return x//m

a,b,n = map(int,input().split())
if a==0:
	print(sol(b,n)+1)


else:
	print(sol(b,n)-sol(a-1,n))

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a+x-1)//x+1)

Solution (Python):
a,b,x=map(int,input().split())
ans=b//x-a//x
print(ans+1 if a%x == 0 else ans)

Solution (Python):


a, b, x = map(int, input().split())

l = a // x
r = b // x
ans = r - l
if a % x == 0:
    ans += 1
print(ans)

Solution (Python):
a, b, x = map(int, input().split())
n1 = a // x
n2 = b // x
if n1 * x < a:
    n1 += 1
print(n2 - n1 + 1)

Solution (Python):

a, b, x = map(int, input().split())
res = (b // x) - ((a-1) // x)
print(res)

Solution (Python):
a,b,x = map(int,input().split())
if a % x == 0:
    print(b//x - a//x + 1)
else:
    print(b//x - a//x)

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):
a,b,x= map(int, input().split())
tx =0
xb = b//x
xa = a//x
if a % x ==0:
    tx = 1

print(int(xb-xa+tx))

Solution (Python):
A, B, x = map(int,input().split())
b_d = B//x+1
a_d = A//x
if A!=0 and A%x!=0:
   a_d+=1
print(b_d - a_d)

Solution (Python):
A,B,X=map(int,input().split())
print((B//X)-(A-1)//X)

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):
a,b,x = map(int,input().split())
ans = b//x - a//x
if a%x == 0:
  ans += 1
print(ans)

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    a, b, x = map(int, input().split())
    print(b // x - (a-1) // x)

if __name__ == '__main__':
    main()

Solution (Python):
a,b,x = map(int, input().split())
ans = 0
if a==0:
    a=1
    ans += 1
ans += b//x - (a-1)//x
print(ans)

Solution (Python):
x, y, z = map(int,input().split())
if x%z != 0:
    print(y//z - x//z)
else:
    print(y//z - x//z +1)

Solution (Python):
a, b, x = map(int, input().split())

print(b//x-(a-1)//x)

Solution (Python):
a, b, x = map(int, input().split())
print(b // x - (a-1) // x)

Solution (Python):
a, b, x = map(int, input().split())
b_mod = b//x+1
a_mod = (a-1)//x+1 if a > 0 else 0
ans = b_mod - a_mod
print(ans)

Solution (Python):
a, b, x = map(int, input().split())
min_div = a // x
max_div = b // x

if a % x == 0:
    ans = max_div - min_div + 1
else:
    ans = max_div - min_div
    
print(ans)

Solution (Python):
a,b,c = map(int,input().split())
print(b // c - (a - 1) // c)

Solution (Python):
a, b, x = map(int,input().split())
ans = b // x - (a - 1) // x
print(ans)

Solution (Python):
a,b,x = map(int,input().split())

A = (a // x) + 1 if a % x != 0 else a // x
B = b // x

print(B-A+1)

Solution (Python):
a,b,x = map(int,input().split())
ansa = 0
  
if a==0:
  ansa=-1
else:
  ansa=(a-1)//x

ansb = b//x

print(ansb-ansa)

Solution (Python):
a,b,x = map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b, x = map(int, input().split())
    print(b // x + 1 - max(0, (a - 1) // x + 1))


if __name__ == '__main__':
    resolve()

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)

Solution (Python):
a, b, x = map(int, input().split())
A = a // x - (a % x == 0)
B = b // x

print(B - A)

Solution (Python):
a, b, x = map(int,input().split())

a_divmod = divmod(a, x)
if a_divmod[1] != 0:
    print(b//x - a_divmod[0])
else:
    print(b//x - a_divmod[0] + 1)

Solution (Python):
a, b, x = map(int, input().split())

def calc(n):
    if n > -1 :
        cnt = n // x  + 1
    else:
        cnt = 0
    return int(cnt)
    
cnt_a = calc(a-1)
cnt_b = calc(b)

ans = cnt_b - cnt_a
print(int(ans))

Solution (Python):
a,b,x=map(int,input().split())
print(b//x-(a-1)//x)

Solution (Python):

a, b, x = map(int,input().split())

print(b // x - (a - 1) // x)

Solution (Python):
a,b,x=map(int,input().split())

if a%x==0:
    print(b//x-a//x+1)
else:
    print(b//x-a//x)

Solution (Python):
a, b, x = map(int, input().split())
c = -1
if a % x == 0:
    c = x - 1
else:
    c = a % x - 1

ans = (b-a + 1 + c) // x
print(ans)

Solution (Python):
a,b,x=map(int,input().split())

fb=b//x
fa=(a-1)//x
print(fb-fa)

Solution (Python):
a,b,x = map(int,input().split())

print(b//x-(a-1)//x)

Solution (Python):
a,b,x = map(int,input().split())

ans = 0

print((b)//x-(a+x-1)//x+1)

Solution (Python):
a, b, x = map(int, input().split())
right = b//x
left = (a-1)//x
print(right-left)

Solution (Python):
a, b, x = map(int, input().split())
ans = (b//x) - ((a+x-1)//x) + 1
print(ans)

Solution (Python):
a,b,x = list(map(int, input().split()))
print(b//x - (a-1)//x)

Solution (Python):
a,b,x = map(int, input().split())
print(b//x - a//x + (a%x == 0))

Solution (Python):
a,b,x = map(int,input().split())

q_b = b//x
q_a = a//x
r_a = a%x
if x==1:
    print(b-a+1)
else:
    if r_a == 0:
        print(q_b-q_a + 1 )
    else:
        print(q_b-q_a)