Pagini recente » Cod sursa (job #1865500) | Cod sursa (job #1583164) | Cod sursa (job #348360) | Cod sursa (job #2950012) | Cod sursa (job #2710966)
#include<iostream>
#include<fstream>
using namespace std;
int back[20];
int n, k;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
void print()
{
for (int i = 1; i <= k; i++)
g << back[i] << " ";
g << '\n';
}
void solve_for_back(int p)
{
for (int i = back[p - 1] + 1; i <= n; i++)
{
back[p] = i;
if (p == k)
print();
else
solve_for_back(p + 1);
}
}
int main()
{
f >> n;
for(k=1;k<=n;k++)
solve_for_back(1);
}