Pagini recente » Cod sursa (job #3290525) | Cod sursa (job #764137) | Cod sursa (job #232774) | Cod sursa (job #2785404) | Cod sursa (job #1360263)
#include <fstream>
#include <iostream>
using namespace std;
int n,m;
int v[20];
int viz[20];
void afis(){
for(int i=1;i<=m;i++) printf("%d ",v[i]);
printf("\n");
}
void back(int k){
if(k==m+1) afis();
else {
for(int i=v[k-1]+1;i<=n;i++){
if(!viz[i]){
viz[i]=1;
v[k]=i;
back(k+1);
viz[i]=0;
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}