Pagini recente » Cod sursa (job #255827) | Cod sursa (job #1352606) | Cod sursa (job #2627560) | Cod sursa (job #1844086) | Cod sursa (job #1148293)
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, sol[20];
void back (int p){
int i, j;
if (p == k){
for (j = 1; j <= k; j++)
fout << sol[j] << " ";
fout << '\n';
} else {
for (i = 1; i <= n; i++){
int ok = 1;
for (j = 1; j <= p; j++)
if (sol[j] >= i)
ok = 0;
if (ok){
sol[p + 1] = i;
back(p + 1);
}
}
}
}
int main(){
fin >> n >> k;
back(0);
}