Pagini recente » Cod sursa (job #1590363) | Cod sursa (job #1519577) | Cod sursa (job #891747) | Cod sursa (job #701488) | Cod sursa (job #154649)
Cod sursa(job #154649)
#include<iostream.h>
#include<stdio.h>
int a[20],n,k;
void tip(int i){
for(int p=1;p<=i;p++)printf("%ld ",a[p]);// cout<<a[p]<<" ";
printf("\n");// cout<<endl;
}
int valid(int i){
int p;
for(p=1;p<i;p++)
if(a[p]==a[i] || a[p]>a[i]) return 0;
return 1;
}
void back(int i){
int val;
for(val=1;val<=n;val++)
{
a[i]=val;
if(valid(i))
if(i==k)tip(i);
else back(i+1);
}
}
void main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld %ld",&n,&k);//cin>>n>>k;
back(1);
}