CF758D.Ability To Convert
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Alexander is learning how to convert numbers from the decimal system to any other, however, he doesn't know English letters, so he writes any number only as a decimal number, it means that instead of the letter A he will write the number 10 . Thus, by converting the number 475 from decimal to hexadecimal system, he gets 11311 ( 475=1⋅162+13⋅161+11⋅160 ). Alexander lived calmly until he tried to convert the number back to the decimal number system.
Alexander remembers that he worked with little numbers so he asks to find the minimum decimal number so that by converting it to the system with the base n he will get the number k .
输入格式
The first line contains the integer n ( 2<=n<=109 ). The second line contains the integer k ( 0<=k<1060 ), it is guaranteed that the number k contains no more than 60 symbols. All digits in the second line are strictly less than n .
Alexander guarantees that the answer exists and does not exceed 1018 .
The number k doesn't contain leading zeros.
输出格式
Print the number x ( 0<=x<=1018 ) — the answer to the problem.
输入输出样例
输入#1
13 12
输出#1
12
输入#2
16 11311
输出#2
475
输入#3
20 999
输出#3
3789
输入#4
17 2016
输出#4
594
说明/提示
In the first example 12 could be obtained by converting two numbers to the system with base 13 : 12=12⋅130 or 15=1⋅131+2⋅130 .