当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3373：Changing Digits

题目描述

Given two positive integers n and k, you are asked to generate a new integer, say m, by changing some (maybe none) digits of n, such that the following properties holds:

  1. m contains no leading zeros and has the same length as n (We consider zero itself a one-digit integer without leading zeros.)
  2. m is divisible by k
  3. among all numbers satisfying properties 1 and 2, m would be the one with least number of digits different from n
  4. among all numbers satisfying properties 1, 2 and 3, m would be the smallest one
输入解释

There are multiple test cases for the input. Each test case consists of two lines, which contains n(1≤n≤10100) and k(1≤k≤104, k≤n) for each line. Both n and k will not contain leading zeros.

输出解释

Output one line for each test case containing the desired number m.

输入样例 
2
2
619103
3219
输出样例 
2
119103
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 POJ Monthly--2007.09.09, Rainer
源链接： POJ-3373
最后修改于 2020-10-29T07:00:00+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
3000 65536