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
Input
1 1 10
Output
10
Input
2 -4 4
Output
5
#include<cstdio>
int main()
{
__int64 b,n,m;
scanf("%I64d%I64d%I64d",&b,&n,&m);
__int64 sum=0;
if(n>0)
{
if(n%b==0)
{
sum=1+m/b-n/b;
}
else
{
sum=m/b-n/b;
}
}
else
{
if(n==0)
{
sum=m/b+1;
}
else
{
if(m>=0)
sum=n*(-1)/b+m/b+1;
else
{
n=n*(-1);
m=m*(-1);
if(m%b==0)
{
sum=1+(n/b)-(m/b);
}
else
{
sum=(n/b)-(m/b);
}
}
}
}
printf("%I64d",sum);
return 0;
}