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 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 ≤ 1018; - 1018 ≤ a ≤ b ≤ 1018).
Output
Print the required number.
Sample Input
Input
1 1 10
Output
10
Input
2 -4 4
Output
5
题意:问a到b之间能被k整除的数有几个(注意a,b的范围)
由于a,b的范围比较大,所以不能暴力(暴力是解决不了问题的。。。。),1到n能被k整除的个数为n/k;还要考虑a,b为负,或一正一负,或全为正的情况。将负数转化为正数时为用swap函数(此函数在头文件<algorithm>中)
代码如下:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
__int64 k,a,b,i;
while(scanf("%I64d%I64d%I64d",&k,&a,&b)!=EOF)
{
__int64 ans=0;
if(a<=0&&b<=0)
ans=(-a)/k-(-b-1)/k;
if(a<=0&&b>=0)
ans=(-a)/k+(b)/k+1;
else
ans=b/k-(a-1)/k;
printf("%I64d\n",ans);
}
}