Pagini recente » Cod sursa (job #1032738) | Cod sursa (job #1334678) | Cod sursa (job #358087) | Cod sursa (job #595319) | Cod sursa (job #561655)
Cod sursa(job #561655)
#include<cstdio>
#include<string>
#include<algorithm>
#define infile "combinari.in"
#define outfile "combinari.out"
#define L 20
using namespace std;
void citeste();
void rezolva();
void afiseaza();
int n,m;
int a[L];
void citeste()
{
freopen(infile,"r",stdin);
scanf("%d %d",&n, &m);
fclose(stdin);
}
void gen_comb(int k)
{
if(k>m) afiseaza();
else
{
for(int i=a[k-1]+1;i<=n;i++)
a[k]=i, gen_comb(k+1);
}
}
void afiseaza()
{
for(int i=1;i<=m;i++)
printf("%d ",a[i]);
printf("\n");
}
int main()
{
citeste();
a[0]=0;
freopen(outfile,"w",stdout);
gen_comb(1);
fclose(stdout);
return 0;
}