题目描述
blablabla
样例
blablabla
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
using namespace std;
const int N = 20;
const int M = 10001;
long long arr1[M];
int n,n1;
bool arr[N];
int index1 = 0;
void dfs(int u){
if(u>9){
long long p = 0;
for(int i=0;i<=9;i){
if(arr[i]){
p+=pow(n,i);
}
}
arr1[index1] = p;
}
else{
arr[u] = true;
dfs(u+1);
arr[u] = false;
dfs(u+1);
}
}
int main(int argc, char** argv) {
cin>>n>>n1;
dfs(0);
sort(arr1,arr1+index1);
cout<<arr1[n1];
return 0;
}
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla