Pagini recente » Cod sursa (job #1687294) | Cod sursa (job #1662063) | Cod sursa (job #1353012) | Cod sursa (job #1519115) | Cod sursa (job #1777965)
#include <stdio.h>
#include <fstream>
using namespace std;
ifstream intrare("combinari.in");
ofstream iesire("combinari.out");
int x[100], n, p;
int valid(int k)
{
if(k>1)
if(x[k-1]>=x[k])
return 0;
return 1;
}
int sol(int k)
{
return k==p;
}
void tipar(int k)
{
for(int i=1; i<=k; i++)
printf("%d ", x[i]);
printf("\n");
}
void bkt()
{
int k=1;
x[k]=0;
while(k!=0)
{
if(x[k]<n)
{
x[k]=x[k]+1;
if(valid(k))
if(sol(k))
tipar(k);
else
{
k++;
x[k]=0;
}
}
else
k--;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d", &n);
scanf("%d", &p);
bkt();
return 0;
}