Pagini recente » Cod sursa (job #875789) | Cod sursa (job #2253255) | Cod sursa (job #2260155) | Cod sursa (job #1074209) | Cod sursa (job #1921786)
#include <stdio.h>
using namespace std;
int sol[19];
int afisare(int k)
{
for(int i = 1; i <= k; i++)
printf("%d ",sol[i]);
printf("\n");
}
void comb(int k, int n, int p)
{
if(k == p+1)
afisare(k-1);
else
for(int i = sol[k-1]+1; i <= n-p+k; i++) {
sol[k] = i;
comb(k+1, n, p);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n, p, i;
scanf("%d%d",&n,&p);
comb(1,n,p);
return 0;
}