Pagini recente » Cod sursa (job #1046990) | Istoria paginii runda/sibiu_contest_oni | Cod sursa (job #2174985) | Cod sursa (job #1080765) | Cod sursa (job #2077766)
#include <iostream>
#include <fstream>
#define NMAX 20
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n, sol[NMAX];
void printSol(int limit) {
bool intrat = 0;
for (int i = 0; i < limit; i++) {
fout<<sol[i]<<" ";
intrat = 1;
}
if (intrat)
fout<<"\n";
}
void back(int pos) {
printSol(pos);
for (int i = 1; i <= n; i++) {
if (sol[pos-1] < i) {
sol[pos] = i;
back(pos + 1);
}
}
}
int main()
{
fin >> n;
back(0);
fin.close();
fout.close();
return 0;
}