Pagini recente » Cod sursa (job #2896588) | Cod sursa (job #179779) | Cod sursa (job #551233) | Cod sursa (job #2636567) | Cod sursa (job #856665)
Cod sursa(job #856665)
#include <iostream>
#include <fstream>
using namespace std;
int st[17];
int k,i,n;
ifstream in ("submultimi.in");
ofstream out ("submultimi.out");
void init ()
{
st[k] = -1;
}
bool succesor ()
{
if (st[k]<1)
{
st[k]++;
return true;
}
return false;
}
bool valid ()
{
return true;
}
bool solutie ()
{
return (k == n);
}
void tipar ()
{
for (int i=1;i<=n;i++)
if (st[i])
{
out<<i<<" ";
}
out<<"\n";
}
void bkt ()
{
bool as;
k=0;
while (k>=0)
{
do {}
while ((as=succesor()) && (!valid()));
if (as)
if (solutie()) tipar();
else
{
k++;
init();
}
else k--;
}
}
int main ()
{
in>>n;
bkt();
return 0;
}