| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 55903 | 朱宸瑜 | 彩票 | C++ | Accepted | 100 | 9 MS | 252 KB | 397 | 2022-07-31 20:08:00 |
#include<iostream> using namespace std; int zj[60],a,choice[10]; void dfs(int sid,int x){ if(x>=6){ for(int i=0;i<6;i++){ cout<<choice[i]<<" "; } cout<<endl; return; } for(int i=sid;i<a;i++){ choice[x]=zj[i]; dfs(i+1,x+1); } } int main(){ while(cin>>a&&a){ for(int i=0;i<a;i++){ cin>>zj[i]; } dfs(0,0); cout<<endl; } return 0; }