Pagini recente » Cod sursa (job #2245378) | Cod sursa (job #3235990) | Cod sursa (job #3138996) | oji200911 | Cod sursa (job #1973365)
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n;
int v[17];
void back()
{
int i = 0;
for (i=1; i<=v[0]; i++)
fout << v[i] << " ";
if (v[0] != 0)
fout << "\n";
for (i=v[v[0]]+1; i<=n; i++)
{
v[++v[0]] = i;
back();
v[v[0]] = 0;
v[0]--;
}
}
int main()
{
fin >> n;
back();
//cu back obtin si lexicografic
//ar mai fi si:
/*
while (v[0] == 0)
{
i = n;
while (v[i] == 1)
{
v[i] = 0;
i--;
}
v[i] = 1;
for (i=1; i<=n; i++)
if (v[i] == 1)
fout << i << " ";
fout << "\n";
}
*/
return 0;
}