Cod sursa(job #1899253)
Utilizator | Data | 2 martie 2017 16:51:37 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
using namespace std;
int n, m;
int sol[20];
void afisare()
{
for(int i=1; i<=m; i++)
printf("%d ", sol[i]);
printf("\n");
}
void bt(int k)
{
if(k>m)
{
afisare();
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;
}