Codeforces 817C Really Big Numbers - 二分法 - 数论

Ivan likes to learn different things about numbers, but he is especially interested in really big numbers. Ivan thinks that a positive integer number x is really big if the difference between x and the sum of its digits (in decimal representation) is not less than s. To prove that these numbers may have different special properties, he wants to know how rare (or not rare) they are — in fact, he needs to calculate the quantity of really big numbers that are not greater than n.

Ivan tried to do the calculations himself, but soon realized that it's too difficult for him. So he asked you to help him in calculations.

Input

The first (and the only) line contains two integers n and s (1 ≤ n, s ≤ 10¹⁸).

Output

Print one integer — the quantity of really big numbers that are not greater than n.

Examples

input

12 1

output

3

input

25 20

output

0

input

10 9

output

1

Note

In the first example numbers 10, 11 and 12 are really big.

In the second example there are no really big numbers that are not greater than 25 (in fact, the first really big number is 30: 30 - 3 ≥ 20).

In the third example 10 is the only really big number (10 - 1 ≥ 9).

---

　　题目大意 设,定义，求满足的X有 多少个。

　　随便举几个数10， 20， 30， 100,然后发现对应的函数值的分别为9, 18, 27和99猜测它满足"单调性"。

　　现在来证明一下，当A > B时，。

　　

　　当最高的不相同的位数为k，则A - B的最小值为$10^{k - 1}$，后面的各位数字之差最小为 -9(k - 1)(个位为第1位)，显然这两个数的和大于等于0。

　　所以就可以二分出第一个满足要求的数，然后算一算就好了。

Code

 #include <iostream>
 #include <cstdio>
 #include <ctime>
 #include <cmath>
 #include <cctype>
 #include <cstring>
 #include <cstdlib>
 #include <fstream>
 #include <sstream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <stack>
 #ifndef WIN32
 #define Auto "%lld"
 #else
 #define Auto "%I64d"
 #endif
 using namespace std;
 typedef bool boolean;
 const signed int inf = (signed)((1u << ) - );
 const signed long long llf = (signed long long)((1ull << ) - );
 const double eps = 1e-;
 const int binary_limit = ;
 #define smin(a, b) a = min(a, b)
 #define smax(a, b) a = max(a, b)
 #define max3(a, b, c) max(a, max(b, c))
 #define min3(a, b, c) min(a, min(b, c))
 template<typename T>
 inline boolean readInteger(T& u){
     char x;
     int aFlag = ;
     while(!isdigit((x = getchar())) && x != '-' && x != -);
     if(x == -) {
         ungetc(x, stdin);
         return false;
     }
     if(x == '-'){
         x = getchar();
         aFlag = -;
     }
     for(u = x - ''; isdigit((x = getchar())); u = (u * ) + x - '');
     ungetc(x, stdin);
     u *= aFlag;
     return true;
 }

 #define LL long long

 LL n, s;

 inline void init() {
     readInteger(n);
     readInteger(s);
 }

 boolean check(LL x) {
     LL y = x, bitsum = ;
     while(y)    bitsum += y % , y /= ;
     return x - bitsum >= s;
 }

 inline void solve() {
     LL l = , r = n;
     while(l <= r) {
         LL mid = (l + r) >> ;
         if(check(mid))    r = mid - ;
         else l = mid + ;
     }
     printf(Auto"\n", n - r);
 }

 int main() {
     init();
     solve();
     return ;
 }