A11154 | The number on the board
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Some natural number was written on the board. Its sum of digits was not less than $k$ . But you were distracted a bit, and someone changed this number to $n$ , replacing some digits with others. It's known that the length of the number didn't change.
You have to find the minimum number of digits in which these two numbers can differ.
You have to find the minimum number of digits in which these two numbers can differ.
输入格式
The first line contains integer $k$ ( $1<=k<=10^{9}$ ).
The second line contains integer $n$ ( $1<=n<10^{100000}$ ).
There are no leading zeros in $n$ . It's guaranteed that this situation is possible.
The second line contains integer $n$ ( $1<=n<10^{100000}$ ).
There are no leading zeros in $n$ . It's guaranteed that this situation is possible.
输出格式
Print the minimum number of digits in which the initial number and $n$ can differ.
输入输出样例
输入 #1
3 11
输出 #1
1
输入 #2
3 99
输出 #2
0
In the first example, the initial number could be $12$ .
In the second example the sum of the digits of $n$ is not less than $k$ . The initial number could be equal to $n$ .
In the second example the sum of the digits of $n$ is not less than $k$ . The initial number could be equal to $n$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted