codeforces 758D-D - Ability To Convert 数学细节题

D. Ability To Convert

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

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 letterA he
will write the number 10. Thus, by converting the number
475 from decimal to hexadecimal system, he gets11311 (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 basen he will get the number
k.

Input
The first line contains the integer n (2 ≤ n ≤ 109). The second line contains the integerk
(0 ≤ k < 1060), it is guaranteed that the numberk 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.

Output
Print the number x (0 ≤ x ≤ 1018) — the answer to the problem.

Examples

Input

13
12

Output

12

Input

16
11311

Output

475

Input

20
999

Output

3789

Input

17
2016

Output

594

Note
In the first example 12 could be obtained by converting two numbers to the system with base13:
12 = 12·130 or15 = 1·131 + 2·130.

题目大意：任意进制转换，题目给出了一个任意进制转换后的结果，并以题中所给方式输出，要求我们找出最小的原十进制数。

题解：仔细思考就能想到，最优的策略肯定是贪心的使得低次方的系数尽可能的大。按照这个思路处理即可，但是注意连续0是有占位的，需要特别处理，而且在处理过程中会爆LL，所以还需要特别判定。

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

long long quick1(long long a,long long b)
{
long long ans = 1;
while(b)
{
if(b&1)
{
ans =ans*a;
b--;
}
b/=2;
a = a*a;
}
return ans;
}

int main()
{
long lon
abf4
g n;
char c[100];
cin>>n;
cin>>c;
long long len=strlen(c);
long long now=0;
long long i;
long long ans=0;
long long f1;
for(i=len-1;i>=0;i--)
{
long long now1=c[i]-'0';
long long g=1;
f1=i;
while(i-1>=0&&now1+(c[i-1]-'0')*quick1(10,g)<n&&now1+1*quick1(10,g)<n)
{
//cout<<now1<<endl;
//g++;
now1=now1+(c[i-1]-'0')*quick1(10,g);
g++;
i--;
if(c[i]!='0')
f1=i;
}
i=f1;
//cout<<f1<<endl;
ans+=now1*quick1(n,now);
now++;
}
cout <<ans<< endl;
return 0;
}