Cod sursa(job #1147889)
| Utilizator | Data | 20 martie 2014 11:08:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int n, m, sol[20];
void bt(int k)
{
if (k==m+1)
{
for (int i=1; i<k; i++)
printf("%d ", sol[i]);
printf("\n");
return;
}
for (int v=sol[k-1]+1; v<=n; v++)
{
sol[k]=v;
bt(k+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &m);
bt(1);
return 0;
}
