SGT 2016-10-12 05:22:51
点我顶贴
收藏
删除
#include<iostream>
#include<cmath>
using namespace std;
const int maxn=100;
int B[maxn];
//输入
int k,N;
void solve(int k,int N)
{
int i=0;
long long result=0;
while(N>0)
{
B[i]=N%2;
N=N/2;
i++;
}
for(int j=0;j<i;j++)
{
if(B[j] == 1)
result+=pow(k,j);
}
cout<<result;
}
int main()
{
do
{
cin>>k>>N;
}while (k<3||k>15);
solve(k,N);
return 0;
}