CodeForces - 758D【贪心+精度】

D. Ability To Convert
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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.

Input
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.

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 base 13: 12 = 12·130 or 15 = 1·131 + 2·130.
题意：
第一行代表n进制，第二行是n进制下的一段字符串，你需要将其转化成十进制输出
思路：
贪心思想，将字符串逆着贪心，不过有0的存在比较棘手（代码写的比较乱，我详细说下思路吧）；
根据进制的求法，可以逆着贪心，直到加到cnt>=n时终止，由于相临几项存在0（比如最后一组数据），这个时候需要在正着找回非0的前一位，依次贪心下去。除此之外，注意当long long时，不要用sqrt和pow；

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
#define max_n 110
using  namespace std;
typedef long long LL;
char a[max_n];
LL b[max_n];

LL judge(LL x,LL y) //不要用pow，和sqrt一样，double只针对于1~1e16，暴力写不会TLE 
{
    LL ans=1,res=0;
    for(int i=0;i<y;i++)
    {
        ans*=x;
    }
    return ans;
}

LL getp(LL n)
{
    LL sum=0,res=0;
    LL len=strlen(a);
    for(int i=0;i<len;i++)
    {
        sum+=b[i]*judge(n,i);
    }
    return sum;
}

int main()
{
    LL n;
    memset(b,0,sizeof(b));
    scanf("%lld",&n);
    getchar();
    scanf("%s",a);
    if(n==10) 
    {
        puts(a);
        return 0;
    }
    int len=strlen(a);
    for(int i=0;i<len;i++)
        b[i]=a[len-i-1]-'0';
    LL sum=0,res=0,ans=0,cnt=0,id,j=0;
    if(n<=10) //特判一下 
    {
        printf("%lld\n",getp(n));
        return 0;
    }
    for(int i=0;i<len;i++)
    {
        cnt=b[i];
        id=0;
        while(cnt<n && i+id<len)
        {
            id++;
            cnt+=b[i+id]*judge(10,id);
        }
        cnt-=b[i+id]*judge(10,id);
        j=i+id-1;
        while(b[j]==0 && j>i) //查 0 
        {
            j--;
        }
        i=j;
        sum+=cnt*judge(n,res);
        res++;
    }
    printf("%lld\n",sum);
    return 0;
}