Pagini recente » Cod sursa (job #2664234) | Cod sursa (job #3228953) | Cod sursa (job #1669903) | Cod sursa (job #372311) | Cod sursa (job #1150986)
#include <iostream>
#include <cstdio>
using namespace std;
int n, p;
int s[20];
void afisare()
{
for (int i=1; i<=p; i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int k)
{
if (k == p+1)
afisare();
else
for (int i=s[k-1]+1; i<=n; i++)
{
s[k] = i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n, &p);
back(1);
return 0;
}