Pagini recente » Cod sursa (job #5134) | Cod sursa (job #401341) | Cod sursa (job #1254816) | Cod sursa (job #1673873) | Cod sursa (job #645088)
Cod sursa(job #645088)
#include<cstdio>
using namespace std;
int sol[20],n,i;
bool pus[20];
bool ok(int k)
{
int i;
bool ok1=true;
for (i=1;i<k-1;i++)
if (sol[i]>sol[i+1]) ok1=false;
return ok1;
}
void afis(int k)
{
int i;
for(i=1;i<k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k<=n) {
if (ok(k)) afis(k);
for (i=1;i<=n;i++)
if (!pus[i] ) { sol[k]=i;
pus[i]=true;
back(k+1);
pus[i]=false;
}
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
pus[i]=false;
back(1);
for(i=1;i<=n;i++)
printf("%d ",i);
return 0;
}