Pagini recente » Cod sursa (job #1092576) | Cod sursa (job #2168676) | Cod sursa (job #1879470) | Cod sursa (job #2147287) | Cod sursa (job #1276620)
# include <cstdio>
using namespace std;
int k,a[99999],sol[9999],m,n;
void afis(int k) {
int i;
for (i=1; i<=m; i++)
printf("%d ",a[sol[i]]);
printf("\n");
}
void backt(int k) {
int i;
if (k>m) afis(k);
else {
for (i=sol[k-1]+1; i<=n; i++) {
sol[k]=i;
backt(k+1);
}
}
}
int main ()
{freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf ("%d%d",&n,&m);
for (int i=1; i<=n; i++) a[i]=i;
backt(1);
}