CF1932E.Final Countdown

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn ( 1n41051 \le n \le 4 \cdot 10^5 ) mechanical indicators, each showing one decimal digit. You noticed that when the countdown changes its state from xx to x1x-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 tt ( 1t1041 \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 nn ( 1n41051\le n\le 4\cdot 10^5 ).

The second line contains a string of nn digits, the current state of the countdown. It is guaranteed that at least one digit is not zero.

The sum of nn for all tests does not exceed 41054\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 24+1(424)=462\cdot 4 + 1\cdot(42-4) = 46 .

首页