Pagini recente » Cod sursa (job #568808) | Cod sursa (job #74309) | Cod sursa (job #3001966) | Borderou de evaluare (job #282020) | Cod sursa (job #2638578)
#include <fstream>
using namespace std;
const int NMAX = 20;
int n, k, v[NMAX], viz[NMAX];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void backt(int poz){
if(poz == k + 1){
for(int i = 1; i <= k; i++)
fout << v[i] << " ";
fout << "\n";
}
for(int i = v[poz - 1] + 1; i <= n; i++){
if(!viz[i]){
v[poz] = i;
viz[i] = 1;
backt(poz+1);
viz[i] = 0;
}
}
}
int main()
{
fin>> n >> k;
backt(1);
return 0;
}