Divisibility（区间）

Divisibility

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 597A

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 ≤ 10¹⁸; - 10¹⁸ ≤ a ≤ b ≤ 10¹⁸).

Output

Print the required number.

Sample Input

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

注意：0对任何数（除0外）的余数都是0。

My  solution：

/*2016.3.12*/

#include
int main()
{
	long long a,b,k,n,m,t;
	while(scanf("%I64d%I64d%I64d",&k,&a,&b)==3)
	{
		n=0;
		if(a>=0)
		{
			if(a==0)
			{
				n=b/k+1;
			}
			else
			{
				if(a%k==0)
				n=b/k-a/k+1;
				else
				n=b/k-a/k;
			}
		}
		if(b<=0&&a<0)
		{
			if(b==0)
			n=b/k-a/k+1;
			else
			{
				if(b%k==0)
				n=b/k-a/k+1;
				else
				n=b/k-a/k;
			}
		}
		if(a<0&&b>0)
		{
			n=b/k-a/k+1;
		}
		printf("%I64d\n",n);
	}
	return 0;
}