A. Divisibility

66 阅读 0 评论 44 点赞

我是靠谱客的博主单纯便当，这篇文章主要介绍A. Divisibility，现在分享给大家，希望可以做个参考。

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 xthat 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 test(s)

Input

复制代码

1
1 1 10

Output

复制代码

1
10

Input

复制代码

1
2 -4 4

Output

复制代码

1
5

AC:

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<stdio.h>
int main()
{
	long long k,a,b;
	while(scanf("%lld%lld%lld",&k,&a,&b)!=EOF)
	{
		long long s=0;
		if(b<0)
		{
			a=-a;b=-b;
			long long t=a;
			a=b;
			b=t;
		}
		s=b/k-a/k;
		if(a%k==0||a<=0)
		   s++;
		printf("%lldn",s);
	}
	return 0;
 }