Cod sursa(job #1656750)
Utilizator | Solcan Mihai Andrei SolcanMihai | Data | 19 martie 2016 19:07:32 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <cstdio>
using namespace std;
int n, m;
int sol[20];
void citire()
{
scanf("%d %d", &n, &m);
}
void afisare()
{
for(int i = 0; i < m; i++)
{
printf("%d ", sol[i]);
}
printf("\n");
}
void backtrack(int k)
{
if(k == m)
{
afisare();
}
else
{
for(int i = k + 1; i <= n; i++)
{
if(i > sol[k - 1])
{
sol[k] = i;
backtrack(k + 1);
}
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
citire();
backtrack(0);
return 0;
}