Pagini recente » Cod sursa (job #1336627) | Cod sursa (job #2368196) | Istoria paginii runda/testroundid | Istoria paginii runda/tema_1_lot2023_ | Cod sursa (job #1666219)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n;
const int NMAX = 18;
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;
int nr = 0;
while(vf)
{
st[vf]++;
if(st[vf] > n)
vf--;
else
{
if(ok() && vf<=n)
{
nr++;
afisare();
st[++vf] = 0;
}
}
}
out<<nr<<"\n";
out.close();
return 0;
}