| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 136326 | 熊婉月 | 组合问题 | C++ | Accepted | 100 | 4 MS | 252 KB | 366 | 2024-03-09 08:39:49 |
#include<bits/stdc++.h> using namespace std; int r,a[100],n; void dfs(int k){ int i; if(k>r){ for(i=1;i<=r;i++){ cout<<a[i]; } cout<<endl; return ; } for(i=a[k-1]+1;i<=n;i++){ a[k]=i; dfs(k+1); } } int main() { cin>>n>>r; dfs(1); return 0; }