Pagini recente » Cod sursa (job #610543) | Cod sursa (job #160989) | Profil bravo_tiramisu | Istoria paginii monthly-2012/runda-3/solutii | Cod sursa (job #1010265)
#include <cstdio>
using namespace std;
int k,p,n,a[100];
void afisare()
{
for (int i=1;i<=p;i++) printf("%d ", a[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k>p) afisare();
else
for (i=a[k-1]+1;i<=n;i++)
{
a[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;
}