Pagini recente » Cod sursa (job #722082) | Cod sursa (job #1959772) | Cod sursa (job #2820225) | Cod sursa (job #88736) | Cod sursa (job #1487596)
#include <iostream>
#include <fstream>
using namespace std;
int sol[20];
int n,m;
void read()
{
scanf("%d %d",&n,&m);
sol[0]=0;
}
void show()
{
for(int i=1;i<=m;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bt(int k)
{
if(k==m+1)
show();
else
for(int i=sol[k-1]+1;i<=n;i++)
{sol[k]=i;
bt(k+1);}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
read();
bt(1);
return 0;
}