Pagini recente » Cod sursa (job #291545) | Istoria paginii runda/pregatire_oji_11-12_2 | Istoria paginii runda/secvente | participati | Cod sursa (job #1666208)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n;
const int NMAX = 17;
typedef int stiva[NMAX];
stiva st;
int vf;
int ok()
{
if(vf > 1)
{
if(st[vf] <= st[vf-1])
return 0;
}
return 1;
}
void afisare()
{
for(int i=1;i<=vf;i++)
out<<st[i]<<" ";
out<<"\n";
}
int main()
{
in>>n;
in.close();
vf = 1;
st[vf] = 0;
while(vf)
{
st[vf]++;
if(st[vf] > n)
vf--;
else
{
if(ok() && vf<=n)
{
afisare();
st[++vf] = 0;
}
}
}
out.close();
return 0;
}