题解:LINE Verda Programming Contest(AtCoder Beginner Contest 263)C - Monotonically Increasing
·难度
入门
·题目
C - Monotonically Increasing (atcoder.jp)
·思路
用dfs遍历所有情况即可。
·代码
Submission #42277829 - LINE Verda Programming Contest(AtCoder Beginner Contest 263)
#include<bits/stdc++.h>
#define N 11
using namespace std;
int ans[N]={},m=0,n=0;
void dfs(int s,int x);
int main(){
scanf("%d%d",&n,&m);
dfs(1,1);
return 0;
}
void dfs(int s,int x){
if(s==n+1){
for(int i=1;i<=n;i++){
printf("%d ",ans[i]);
}
printf("\n");
return;
}
for(int i=x;i<=m;i++){
ans[s]=i;
dfs(s+1,i+1);
ans[s]=0;
}
}