Codeforces--597A--Divisibility（数学）



DivisibilityCrawling 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 ≤ 10¹⁸; - 10¹⁸ ≤ a ≤ b ≤ 10¹⁸).

Output

Print the required number.

Sample Input

Input

1 1 10

Output

10

Input

2 -4 4

Output

5

#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){__int64 a,b,k;while(scanf("%I64d%I64d%I64d",&k,&a,&b)!=EOF){__int64 ans=0;ans=b/k-a/k;if(a==0&&b==0) cout<<1<<endl;else{if(a>=0&&b>=0&&a%k==0) ans++;else if(a<=0&&b<=0&&b%k==0) ans++;else if(a<=0&&b>=0) ans++;printf("%I64d\n",ans);}}return 0;}