Pagini recente » Cod sursa (job #1605094) | Cod sursa (job #2677459) | Cod sursa (job #2735150) | Cod sursa (job #1321829) | Cod sursa (job #2334654)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout("combinari.out");
const int N_MAX = 100 + 5;
int x[N_MAX];
int N, K;
void afis(int k){
for(int i = 1; i<=k; ++i, fout << " ")
fout << x[i];
fout << "\n";
}
void bk(int k){
for(int i = x[k-1] + 1; i<=N; ++i){
x[k] = i;
if(k == K)
afis(k);
else
bk(k+1);
}
}
int main(){
fin >> N >> K;
bk(1);
return 0;
}
// român convertit la moldovenism