Divisibility(区间)

来源:互联网 发布:千牛淘宝修改店铺名称 编辑:程序博客网 时间:2024/05/19 20:46

Divisibility
Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:262144KB     64bit IO Format:%I64d & %I64u
SubmitStatus Practice CodeForces 597A

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 valuesx that a ≤ x ≤ b andx 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
注意:0对任何数(除0外)的余数都是0。

My  solution:

/*2016.3.12*/

#include<stdio.h>int main(){long long a,b,k,n,m,t;while(scanf("%I64d%I64d%I64d",&k,&a,&b)==3){n=0;if(a>=0){if(a==0){n=b/k+1;}else{if(a%k==0)n=b/k-a/k+1;elsen=b/k-a/k;}}if(b<=0&&a<0){if(b==0)n=b/k-a/k+1;else{if(b%k==0)n=b/k-a/k+1;elsen=b/k-a/k;}}if(a<0&&b>0){n=b/k-a/k+1;}printf("%I64d\n",n);}return 0;}




0 0
原创粉丝点击