Pagini recente » Istoria paginii runda/mlindulmropta | Monitorul de evaluare | Statistici Diaconescu Luciano (lucidiaconescu) | Istoria paginii utilizator/iliealex2012 | Cod sursa (job #168043)
Cod sursa(job #168043)
#include<stdio.h>
int n,m,a[20];
int ok(int k){
if(k>1&&a[k]<=a[k-1])
return 0;
return 1;
}
void back(int k){
int i;
for(i=1;i<=n;i++)
{
a[k]=i;
if(ok(k))
{
if(k==m)
{
for(i=1;i<=m;i++)
printf("%d ", a[i]);
printf("\n");
}
else
back(k+1);
}
}
}
int main(){
freopen("combinari.in","r",stdin); //combinari de n luate cate m
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}