Codeforces Round #135 (Div. 2) B. Special Offer! Super Price 999 Bourles!

B. Special Offer! Super Price 999 Bourles!

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarpus is an amateur businessman. Recently he was surprised to find out that the market for paper scissors is completely free! Without further ado, Polycarpus decided to start producing and selling such scissors.

Polycaprus calculated that the optimal celling price for such scissors would be p bourles. However, he read somewhere that customers are attracted by prices that say something like "Special Offer! Super price 999 bourles!". So Polycarpus decided to lower the price a little if it leads to the desired effect.

Polycarpus agrees to lower the price by no more than d bourles so that the number of nines at the end of the resulting price is maximum. If there are several ways to do it, he chooses the maximum possible price.

Note, Polycarpus counts only the trailing nines in a price.

Input

The first line contains two integers p and d (1 ≤ p ≤ 1018; 0 ≤ d < p) — the initial price of scissors and the maximum possible price reduction.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

Output

Print the required price — the maximum price that ends with the largest number of nines and that is less than p by no more than d.

The required number shouldn't have leading zeroes.

Sample test(s)

input

1029 102

output

999

input

27191 17

output

27189

题意：输入p和d两个数，p减去小于等于d的一个数，使得尾数中9最多。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
   long long p,q,i,j,k,s;
  while(~scanf("%lld%lld",&p,&q))
   {
      p=p+1;   long long s=p;//p+1是为了防止出现99999...这种情况和p==1
       for(i=10;;i*=10)
        {
            if(p%i>q)
               break;
            s=p-p%i;
        }

      printf("%lld\n",s-1);

   }
  return 0;
}