Pagini recente » Cod sursa (job #2086798) | Cod sursa (job #2586070) | Cod sursa (job #952461) | Cod sursa (job #2976045) | Cod sursa (job #447411)
Cod sursa(job #447411)
#include<cstdio>
#include<fstream>
#include<iostream>
using namespace std;
#define nn 20
int v[nn],x[nn];
int n,k;
void verifica ()
{
int pp=1;
for(int i=1;i<k&&pp==1;++i)
if(!(v[i]<v[i+1]))
pp=0;
if(pp==1){
for(int i=1;i<=k;++i)
printf("%d ",v[i]);
printf("\n");
}
}
void back (int p)
{
int i;
if(p>k)
verifica();
else
for(i=1;i<=n;++i)
if(x[i]==0){
v[p]=i;
x[i]=1;
back(p+1);
x[i]=0;
}
}
int main ()
{
ifstream fin ("combinari.in");
freopen("combinari.out","w",stdout);
fin>>n>>k;
fin.close();
back(1);
return 0;}