Pagini recente » Cod sursa (job #3164879) | Cod sursa (job #1979280) | Cod sursa (job #2830895) | Cod sursa (job #1761978) | Cod sursa (job #1750432)
#include <iostream>
#include <cstdio>
using namespace std;
int x[20],k;
int N,M;
void afis()
{
for(int i=1;i<=M;i++)
printf("%d ",x[i]);
printf("\n");
}
void rezolvare()
{
for(int i=1;i<=M;i++)
x[i]=i;
k=M;
while(k)
{
afis();
k=M;
while(x[k]>=N - (M-k) && k)
k--;
if(k==0)
return;
x[k]++;
for(int i=k+1;i<=M;i++)
x[i]=x[i-1]+1;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&M);
rezolvare();
return 0;
}