Pagini recente » Cod sursa (job #2185381) | Cod sursa (job #947650) | Rating Crudu Sanda (CruduSanda) | Cod sursa (job #2401521) | Cod sursa (job #1261674)
#include<iostream>
#include<fstream> // TOMI NEBUNU
#include<algorithm> // LA IMPLEMENTARE
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int main ()
{
int n,i,v[100000],a[100000];
in>>n;
for (i=1;i<=n;i++)
{ a[i]=i;
v[i]=0;
}
v[n]=1;
while (v[0]==0)
{
// afisam submultime
for (i=n;i>=1;i--)
if (v[i]!=0)
out<<a[i]<<" ";
out<<"\n";
// calculez urmatoarea submultime
for (i=n;v[i]==1;i--)
v[i]=0;
v[i]=1;
}
return 0;
}