?

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

?

#include <map> #include <set> #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <iostream> #include <stack> #include <cmath> #include <vector> #include <cstdlib> //#include <bits/stdc++.h> #define space " " using namespace std; typedef long long LL; //typedef __int64 Int; typedef pair<int,int> paii; const int INF = 0x3f3f3f3f; const double ESP = 1e-5; const double Pi = acos(-1); const int MOD = 1e9+5; const int MAXN = 1e5; long long k, a, b, ans; int main() {while (scanf("%lld%lld%lld", &k, &a, &b) != EOF) {ans = 0; if ((a > 0 && b > 0) || (a < 0 && b < 0)) {ans += abs(b/k); ans -= abs(a/k);if (ans < 0) ans = -ans;if (min(abs(a), abs(b))%k == 0) ans++;}else {ans += abs(b/k); ans += abs(a/k);ans++;}printf("%lld\n", ans);}return 0; }

?

?

轉(zhuǎn)載于:https://www.cnblogs.com/cniwoq/p/6770805.html

總結(jié)

以上是生活随笔為你收集整理的Codeforces Divisibility【水题】的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。