using namespace std; int k,n[20],a,b,c,d,e,f; int main(){ while(cin>>k){ if(k==0) return 0; for(int i=0;i<k;i++) cin>>n[i]; for(a=0;a<+k-6;a++){ for(b=a+1;b<=k-5;b++){ for(c=b+1;c<=k-4;c++){ for(d=c+1;d<=k-3;d++){ for(e=d+1;e<=k-2;e++){ for(f=e+1;f<=k-1;f++){ cout<<n[a]<<n[b]<<n[c]<<n[d]<<n[e]<<n[f]<<endl; } } } } } } cout<<endl; } return 0; }
11 3 5 6 10 13 21 33 41 42 48 49
10 1 2 3 7 14 24 25 42 43 47
12 3 5 10 13 17 18 19 28 33 39 40 44
9 4 6 8 22 30 33 35 44 48
8 15 21 22 26 27 31 39 41
7 2 9 13 16 26 38 40
0
356101321
356101333
356101341
356101342
356101348
356101349
356102133
356102141
356102142
356102148
356102149
356103341
356103342
356103348
356103349
356104142
356104148
356104149
356104248
356104249
3 5 6 10 13 21
3 5 6 10 13 33
3 5 6 10 13 41
3 5 6 10 13 42
3 5 6 10 13 48
3 5 6 10 13 49
3 5 6 10 21 33
3 5 6 10 21 41
3 5 6 10 21 42
3 5 6 10 21 48
3 5 6 10 21 49
3 5 6 10 33 41
3 5 6 10 33 42
3 5 ...
exit code: 0, checker exit code: 0