Pagini recente » Cod sursa (job #2634578) | Cod sursa (job #579710) | Cod sursa (job #226195) | Cod sursa (job #2467116) | Cod sursa (job #2444420)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n, x[40];
void afis(int k)
{
for(int i = 1; i <= k; i++)
g << x[i] << ' ';
g << '\n';
}
/**
void backt(int k)
{
if(k <= n) ///mai avem elemente
for(int i = x[k - 1] + 1; i <= n; i++) /// (*)
{
x[k] = i;
afis(k);
backt(k + 1);
}
}
*/
void backt()
{
int k = 1;
x[1] = 0;
while(k > 0)
if(x[k] < n)
{
x[k]++;
afis(k);
k++;
x[k] = x[k - 1];
}
else
k--;
}
int main()
{
f >> n;
//
x[0] = 0;
backt();
return 0;
}