hdu--1342 lotto(回溯法)

#include "stdio.h"#include "string.h"#include "math.h"int main(){int i,j,n,f=0;int a[13],b[6];while(scanf("%d",&n)&&n!=0){if(f) puts("");for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<6;i++) b[i]=i;j=5;while(1){while(b[j]<=n-6+j){printf("%d",a[b[0]]);for(i=1;i<6;i++) printf(" %d",a[b[i]]);printf("/n");b[j]++;}b[j]--;while(b[j]==n-6+j&&j>0) j--;if(b[j]==n-6+j&&j==0) break;if(b[j]<n-6+j) b[j]++;while(j<=4) {j++; b[j]=b[j-1]+1;}}f=1;}return 0;}