Pagini recente » Cod sursa (job #2519763) | Cod sursa (job #1465973) | Istoria paginii runda/oji200411112 | Cod sursa (job #2262210) | Cod sursa (job #1822402)
#include<fstream>
#include<iostream>
using namespace std;
int n,v[16],m;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
void tipar(int m)
{
for(int i=1;i<=m-1;i++)
out<<v[i]<<" ";
out<<'\n';
}
void back(int k)
{
if(k==m+1)
tipar(k);
else
for(v[k]=v[k-1]+1;v[k]<=n-m+k;v[k]++)
back(k+1);
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
m++;
back(1);
}
}