Pagini recente » Cod sursa (job #758246) | Cod sursa (job #1574609) | Cod sursa (job #764460) | Cod sursa (job #2059714) | Cod sursa (job #2186265)
#include <cstdio>
using namespace std;
int v[17],n,s[17];
void bkt(int p)
{
if (p==n+1)
{
return;
}
else
{
for (int i=p; i<=n; i++)
{
if (s[i]==0&&i>v[p-1])
{
v[p]=i;
v[0]++;
s[i]=1;
for (int j=1; j<=v[0]; j++)
{
printf ("%d ",v[j]);
}
printf ("\n");
bkt(p+1);
s[i]=0;
v[0]--;
}
}
}
}
int main()
{
freopen ("submultimi.in","r",stdin);
freopen ("submultimi.out","w",stdout);
scanf ("%d",&n);
bkt(1);
return 0;
}