除法

最新推荐文章于 2024-01-25 10:10:44 发布

DTL66

最新推荐文章于 2024-01-25 10:10:44 发布

阅读量384

点赞数

分类专栏： --------数据结构----------

本文链接：https://blog.csdn.net/DTL66/article/details/51760645

版权

--------数据结构---------- 专栏收录该内容

12 篇文章 1 订阅

订阅专栏

暑期（二）

744:48:54

1200:00:00

R - R

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

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

Input

2 -4 4

Output

FAQ | About Virtual Judge | Forum | Discuss | Open Source Project
All Copyright Reserved ©2010-2014 HUST ACM/ICPC TEAM
Anything about the OJ, please ask in the forum, or contact author: Isun, but NEVER contact freefcw@gmail.com, who is irrelevant to this site !!
Server Time:

姐：两种情况！

1.b<0, b如果不能整除以k 。则产生物差1.

2.a>0 a如果不能整除以k。则产生误差1.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
long long a,b,n,i,j,l,k,t,s;
while(scanf("%lld%lld%lld",&k,&a,&b)!=EOF)
{
s=b/k-a/k+1;
if(a>=0)
{
if(a%k!=0)
s--;
}
else
if(b<0&&b%k!=0)
s--;

printf("%lld\n",s);
}
return 0;
}