Pagini recente » onis-2014/solutii-runda-4 | Urmasii lui Moisil 2016 | Clasament simulare_11_12_2003 | Statistici Mustatoiu Ioan-Sebastian (Mustatoiu-Ioan-Sebastian) | Cod sursa (job #156787)
Cod sursa(job #156787)
#include<stdio.h>
int n,p;
int a[100];
void afis(int k)
{
int i;
for(i=1;i<=k-1;i++)
printf("%d ",a[i]);
printf("\n");
}
void back(int k)
{
int i;
if(k==p+1)
afis(k);
else
for(i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
back(k+1);
}
}
int main(void)
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
back(1);
return 0;
}