Pagini recente » Cod sursa (job #1196086) | Cod sursa (job #2706507) | Cod sursa (job #3243420) | Cod sursa (job #3234835) | Cod sursa (job #990493)
Cod sursa(job #990493)
#include <cstdio>
using namespace std;
int k,n,st[20];
inline void Afisare()
{
int i;
for(i=1;i<=k;i++)
printf("%d ", st[i]);
printf("\n");
}
int main()
{
int top;
bool cand;
freopen ("submultimi.in","r",stdin);
freopen ("submultimi.out","w",stdout);
scanf("%d", &n);
for(k=1;k<=n;k++)
{
top=1;st[top]=0;
while(top>0)
{
cand=false;
while(!cand && st[top]<n)
{
st[top]++;
cand=true;
}
if(!cand)
top--;
else
if(top==k)
Afisare();
else
{
top++;
st[top]=st[top-1];
}
}
}
return 0;
}