A11304 | Final Countdown
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are in a nuclear laboratory that is about to explode and destroy the Earth. You must save the Earth before the final countdown reaches zero.
The countdown consists of $n$ ( $1 \le n \le 4 \cdot 10^5$ ) mechanical indicators, each showing one decimal digit. You noticed that when the countdown changes its state from $x$ to $x-1$ , it doesn't happen in one move. Instead, each change of a single digit takes one second.
So, for example, if the countdown shows 42, then it will change to 41 in one second, because only one digit is changed, but if the countdown shows 2300, then it will change to 2299 in three seconds, because the three last digits are changed.
Find out how much time is left before the countdown reaches zero.
The countdown consists of $n$ ( $1 \le n \le 4 \cdot 10^5$ ) mechanical indicators, each showing one decimal digit. You noticed that when the countdown changes its state from $x$ to $x-1$ , it doesn't happen in one move. Instead, each change of a single digit takes one second.
So, for example, if the countdown shows 42, then it will change to 41 in one second, because only one digit is changed, but if the countdown shows 2300, then it will change to 2299 in three seconds, because the three last digits are changed.
Find out how much time is left before the countdown reaches zero.
输入格式
The first line of input contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. Then the descriptions of the test cases follow.
The first line of each test case contains a single integer $n$ ( $1\le n\le 4\cdot 10^5$ ).
The second line contains a string of $n$ digits, the current state of the countdown. It is guaranteed that at least one digit is not zero.
The sum of $n$ for all tests does not exceed $4\cdot 10^5$ .
The first line of each test case contains a single integer $n$ ( $1\le n\le 4\cdot 10^5$ ).
The second line contains a string of $n$ digits, the current state of the countdown. It is guaranteed that at least one digit is not zero.
The sum of $n$ for all tests does not exceed $4\cdot 10^5$ .
输出格式
For each test case, print a single integer without leading zeroes, the number of seconds left before the countdown reaches zero. Note that this number may be huge.
输入输出样例
输入 #1
5 2 42 5 12345 2 99 4 0005 27 456480697259671309012631002
输出 #1
46 13715 108 5 507200774732968121125145546
In the first example, there are four changes that take 2 seconds: 40 to 39, 30 to 29, 20 to 19, and 10 to 09, other changes take 1 second each. So the total time is $2\cdot 4 + 1\cdot(42-4) = 46$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted