Pagini recente » Cod sursa (job #74039) | Cod sursa (job #1989422) | Cod sursa (job #171767) | Cod sursa (job #1036753) | Cod sursa (job #1077270)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
const int Nmax = 17;
int N, M, sol[Nmax];
void Afisare()
{
for(int i = 1; i <= M; i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
void Back(int K)
{
if(K == M + 1)
Afisare();
else
for(int i = sol[K - 1] + 1; i <= N - M + K; i++)
{
sol[K] = i;
Back(K + 1);
}
}
int main()
{
fin>>N;
for(M = 1; M <= N; M++)
Back(1);
return 0;
}