Pagini recente » Cod sursa (job #169015) | Cod sursa (job #1489477) | Cod sursa (job #387748) | Cod sursa (job #3354066) | Cod sursa (job #3342541)
#include <iostream>
using namespace std;
const int NMAX = 20;
int solution[NMAX];
void print_solution(int n){
for(int i = 1; i <= n; i++){
printf("%d ", solution[i]);
}
printf("\n");
}
void submultimi(int n, int position){
if(position == n + 1) return;
for(int i = solution[position - 1] + 1; i <= n; i++){
solution[position] = i;
print_solution(position);
submultimi(n, position + 1);
}
}
int main()
{
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
int n;
scanf("%d", &n);
submultimi(n, 1);
return 0;
}