For this Question: Ketani is fond of super simple problems. This time he has come up with another simple problem. Given two non negative numbers A and B. Find the number of multiples of k in the range [A, B] (all integers between A and B, A and B inclusive).The first and the only line of input contains three integers: A B k.

Constraints
0 <= a <= b <= 1000000000000000000 (10^18)
1 <= x <= 1000000000000000000 (10^18)Output a single integer, the number of multiples of k in the given range.Sample Input
4 8 2

Sample Output
3

Explanation: The divisors of 2 in the range [4, 8] are 4, 6, and 8.

Sample Input:
0 5 1

Sample Output:
6, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;



// Driver code
int main()
{
unsigned long long a,b,k,p,q,s=0;
cin>>a>>b>>k;
p=a/k;
if(a%k==0){p--;}
q=b/k;
cout<<max(s,q-p);
 }
, In this Programming Language: C++, Now tell me if this Code is compilable or not?