【CodeForces 597A Divisibility】

最新推荐文章于 2021-01-30 14:58:18 发布

楚江枫

最新推荐文章于 2021-01-30 14:58:18 发布

阅读量425

点赞数

文章标签： codeforces

本文链接：https://blog.csdn.net/WYK1823376647/article/details/52295128

版权

codeforces 专栏收录该内容

172 篇文章 0 订阅

订阅专栏

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 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 ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).

Output
Print the required number.

Examples
input
1 1 10
output
10
input
2 -4 4
output
5

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