CodeForces 597A Divisibility

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

input

2 -4 4

output

#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;}elseans=b/k-(a-1)/k;printf("%lld\n",ans);   }return 0;
}

CodeForces 597A Divisibility相关推荐

【CodeForces 597A Divisibility】
Divisibility Find the number of k-divisible numbers on the segment [a, b]. In other words you need t ...
CodeForces 597A Divisibility
水题. #include<iostream> #include<cstring> #include<cmath> #include<queue> #in ...
CF 597A Divisibility
Divisibility Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Descr ...
CodeForces 550C Divisibility by Eight（暴力）
http://http://codeforces.com/problemset/problem/550/C 题意: 给出一串数字,在原先的顺序基础上适当的删除一些数使得最终的结果能被8整除解题思路: ...
Codeforces 988E. Divisibility by 25
解题思路: 只有尾数为25,50,75,00的数才可能是25的倍数. 对字符串做4次处理,以25为例. a. 将字符串中的最后一个5移到最后一位.计算交换次数.(如果没有找到5,则不可能凑出25,考虑 ...
CodeForces 597A
Description Find the number of k-divisible numbers on the segment [a, b]. In other words you need to ...
CF597 (Div. 2)题解
A.乱搞gcd B.模拟题 C. 原始串中'w'字符会被替换成 uu 'm'字符会被替换成nn, 给你一个字符串,问你他原串有多少种可能 nnn -> nnn nm mn 3种 nnnn -&g ...
比尔·盖茨离婚内幕被曝光：长期出轨微软女下属；传记作者：他不是“技术宅”，好色在业内是公开的秘密！...
点击"开发者技术前线",选择"星标" 让一部分开发者看到未来图片来源网络来源:中国经营报(ID:chinabusinessjournal) ▎比尔盖茨 ...
Codeforces Divisibility【水题】
A. Divisibility time limit per test 1 second memory limit per test 256 megabytes input standard inpu ...

CodeForces 597A Divisibility

CodeForces 597A Divisibility相关推荐

最新文章

热门文章