1-N选M个数进行排列组合

#include "bits/stdc++.h"
using namespace std;
int n,k;
int vis[105], ans[105];

void dfs(int len){
	if(len==k){
		for(int i=0;i<k;i++)
			cout << ans[i] << " ";
		cout << endl;
		return ;
	}
	
	for(int i=0;i<n;i++){
		if(vis[i])
			continue;
		ans[len]=i+1;
		vis[i]=1;
		dfs(len+1);
		vis[i]=0;
	}
}

int main(){
	while(cin >> n >> k){
		int vis[n+5];
		int ans[n+5];
		memset(vis,0,sizeof(vis));
		dfs(0);	
	}
	
	return 0;
}