Run ID Author Problem Lang Verdict Score Time Memory Code Length Submit Time
143599 陈家宝 组合问题 C++ Accepted 100 5 MS 248 KB 277 2024-04-16 17:18:25

Tests(12/12):


#include<bits/stdc++.h> using namespace std; int n,m,a[114],cnt=0; void dfs(int x){ if(x>m){ for(int i=1;i<=m;i++)cout<<a[i]; cout<<endl; return; } for(int i=a[x-1]+1;i<=n;i++){ a[x]=i; dfs(x+1); } } int main(){ cin>>n>>m; dfs(1); return 0; }


Judgement Protocol: