Cod sursa(job #2886627)
Utilizator | Data | 7 aprilie 2022 23:03:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX=20;
int N, K, x[NMAX];
void backtracking(int poz){
for(int i=x[poz-1]+1;i<=N;i++){
x[poz]=i;
if(poz==K){
for(int j=1;j<=K;j++)
fout<<x[j]<<' ';
fout<<'\n';
}
else
backtracking(poz+1);
}
}
int main()
{
fin>>N>>K;
backtracking(1);
fin.close();
fout.close();
return 0;
}