Pagini recente » Cod sursa (job #2652435) | Cod sursa (job #2395910) | Cod sursa (job #3001163) | Cod sursa (job #1613496) | Cod sursa (job #1833450)
#include <iostream>
#include <fstream>
using namespace std;
const int Nmax=2000000;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int v[Nmax+1];
int n,m;
void afis()
{
for(int i=1;i<=m;i++)
out<<v[i]<<" ";
out<<'\n';
}
void back(int k)
{
if(k==m+1)
afis();
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=i;
back(1);
}
}