Pagini recente » Cod sursa (job #941110) | Cod sursa (job #3212956) | Cod sursa (job #3222515) | Cod sursa (job #1749955) | Cod sursa (job #3187403)
#include <bits/stdc++.h>
using namespace std;
int n, V[10], A[10], c;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int k){
// cout << "intru pas " << k << '\n';
if(k == c+1){
for(int i=1; i<=c; i++){
fout << A[i] << ' ';
}
fout << '\n';
// cout << "ies pas " << k << '\n';
return;
}
for(int i=A[k-1]+1; i<=n; i++){
if(!V[i]){
A[k] = i;
V[i] = 1;
// cout << "pas " << k << " iau " << i << '\n';
back(k+1);
// cout << "pas " << k << " scot " << i << '\n';
V[i] = 0;
}
}
// cout << "ies pas " << k << '\n';
}
int main(){
fin >> n >> c;
back(1);
}