| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 56286 | 董承诺 | 彩票 | C++ | Accepted | 100 | 9 MS | 256 KB | 362 | 2022-08-01 17:00:57 |
#include<bits/stdc++.h> using namespace std; int a,b[20],c[7]; void dfs(int d,int e){ if(d>6){ for(int i=1;i<=6;i++){ cout<<c[i]<<" "; } cout<<endl; return; } for(int i=e;i<=a;i++){ c[d]=b[i]; dfs(d+1,i+1); } } int main(){ while(cin>>a&&a){ for(int i=1;i<=a;i++) cin>>b[i]; dfs(1,1); cout<<endl; } return 0; }