CodeForces 597A Divisibility【二元一次方程（区间解数) 讨论)】

A. Divisibility

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ band 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.

Examples

input

1 1 10

output

10

input

2 -4 4

output

5

题意：求[a,b]内能被k整除的数有多少个；

以前写过又wa两次，好好记录一下：

失误处：当a>0时k|a产生影响， 当b<0时k|b产生影响，当a<=0&&b>=0时0产生影响。

AC代码：

#include<cstdio>

typedef long long LL;

int main()
{
	LL k,a,b,ans;
	while(~scanf("%lld %lld %lld",&k,&a,&b))
	{
		ans=b/k-a/k;
		if(b>=0&&a<=0) ++ans;
		else {
			if(a>0&&a%k==0) ++ans;
	        if(b<0&&b%k==0) ++ans;
		}
		
		printf("%lld\n",ans);
	}
	return 0;
}