Cod sursa(job #1141160)
| Utilizator | Data | 12 martie 2014 17:48:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int a[20],sol[20],n,m;
void afis () {
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();
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);
int i;
sol[0]=0;
for (i=1; i<=n; i++) a[i]=i;
backt(1);
}
