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 ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).
Output
Print the required number.
Sample Input
Input
1 1 10
Output
10
Input
2 -4 4
Output
5
题意:给你一个区间,问在这个区间内,有多少个数能被k整除。
思路:需要分三种情况讨论。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
__int64 k,a,b,ans;
while(scanf("%I64d%I64d%I64d",&k,&a,&b)!=EOF)
{
if(a>0&&b>0)
{
ans=abs(b/k)-abs((a-1)/k);
}
else if(a<0&&b<0)
{
ans=abs(a/k)-abs((b+1)/k);
}
else
{
ans=abs(a/k)+abs(b/k)+1;
}
printf("%I64d\n",ans);
}
return 0;
}