CodeForces 597A Divisibility

最新推荐文章于 2021-09-20 09:36:55 发布

原创最新推荐文章于 2021-09-20 09:36:55 发布 · 386 阅读

0 ·

CC 4.0 BY-SA版权

数学专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个计算给定区间[a, b]内能被特定整数k整除的整数数量的算法。该算法通过输入三个整数k、a和b来确定这些数值，并提供了一个C语言实现的示例程序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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




#include<stdio.h>
int main()
{
    long long a,b,k,ans;
   	while(scanf("%lld%lld%lld",&k,&a,&b)!=EOF)
	{
    	if(a<=0&&b<=0)
    	{	
    		long long c;
    		c=-a;
			a=-b;
			b=c;
        }
    	if(a<=0&&b>=0)
    	{
        	a=-a;
        	ans=b/k+a/k+1;
    	}
    	else
        	ans=b/k-(a-1)/k;
    	printf("%lld\n",ans);	
	}
	return 0;
}