Pagini recente » Cod sursa (job #2002132) | Cod sursa (job #1545049) | Cod sursa (job #2682749) | Cod sursa (job #1997054) | Cod sursa (job #1565390)
#include <cstdio>
using namespace std;
int x , n , v[200] ;
void tristenie()
{
for ( int i = 1 ; i < x ; i++ )
{
printf("%d ",v[i]);
}
if ( x > 0 )
{
printf("%d\n",v[x]);
}
}
void bebe_fraier()
{
tristenie();
for ( int i = v[x] + 1 ; i <= n ; ++i )
{
v[++x] = i ;
bebe_fraier();
v[x--] = 0 ;
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
bebe_fraier();
return 0 ;
}