生成排列数（回溯法）

#include <iostream>
using namespace std;
#define n 7
int s[n] = { 1,2,3,4,5,6,7};
int r[6];
int v[n];

void print(){
    for(int i = 0; i<6;i++)
       cout<<s[r[i]]<<" ";
    cout<<endl;
}
void combination(){
    int k = 0 ;r[0] = -1;
	while(k>=0){
		r[k]++;
		while(r[k]<n&&v[r[k]]!=0)
			r[k]++;
		if(r[k]<n){
			v[r[k]] = 1;
			if(k==5)
				print();
		    else{
				k++;
				r[k] = -1;
			}
		}else{
			k--;
			for(int i = r[k]+1; i< n; i++)
				v[i] = 0;
		}
	}
}

int main(){
	memset(v,0,sizeof(v));
	combination();
	return 0 ;
}