RNQOJ 4 数列

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int dig[24];
int main()
{
    int k,n;
    while(cin>>k>>n)
    {
       int rel_k=k;
        memset(dig,0,sizeof(dig));
        int temp=0;
        int total=0;
        while(n)
        {
            dig[temp++]=n%2;
            n/=2;
        }
        for(int i=0;i<temp;i++)
        {
            if(i>1)
            {
                rel_k*=k;
            }
            if(dig[i]&&i==0)
            {
                total+=1;
            }
            else if(dig[i])
            {
                total+=rel_k;
            }
        }
        cout<<total<<endl;
    }
    return 0;
}