Cod sursa(job #2162294)
Utilizator | Data | 12 martie 2018 09:43:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <cstdio>
using namespace std;
int n, k, sol[20];
void backtracking(int nivel)
{
if(nivel==k+1)
{
for(int i=1; i<=k; i++)
{
printf("%d ", sol[i]);
}
printf("\n");
}
else
{
for(int i=sol[nivel-1]+1; i<=n; i++)
{
sol[nivel]=i;
backtracking(nivel+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
backtracking(1);
return 0;
}