Pagini recente » Cod sursa (job #2459471) | Cod sursa (job #1861100) | Cod sursa (job #570308) | Cod sursa (job #2516888) | Cod sursa (job #975763)
Cod sursa(job #975763)
#include<stdio.h>
#define maxn 20
using namespace std;
int n,m;
int x[maxn];
void afis()
{
for(int i=1;i<=m;i++) printf("%d ",x[i]);
printf("\n");
}
void back(int k)
{
int i;
if(k>m) afis();
else
for(i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
fclose(stdin);
fclose(stdout);
return 0;
}