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

Examples

input

1 1 10

output

10

input

2 -4 4

output

5

分情况
1.ab都大于0
2.ab都小于0
3.a小于0，b大于0（记得把0也能整除算上）
整除问题，0的情况分别考虑

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