A. Divisibility
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
1 1 10
output
10
input
2 -4 4
output
5
题意:
给出a,b,k,问在区间【a,b】上(包括端点)有多少个数能整除 k
题解:
完全是数学题目,注意分情况讨论,另外特别注意端点的处理
#include<stdio.h>
typedef long long ll;
ll abs(ll x)
{
return x>0?x:-x;
}
int main()
{
ll k,a,b;
while(~scanf("%I64d%I64d%I64d",&k,&a,&b))
{
ll ans;
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;
}