Pagini recente » Cod sursa (job #3208246) | Cod sursa (job #942514) | Cod sursa (job #141519) | Cod sursa (job #3204341) | Cod sursa (job #786951)
Cod sursa(job #786951)
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n,i,comb[20];
bool next();
int main()
{
int j;
f>>n;
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
g<<j<<' ';
comb[j]=j;}
g<<'\n';
while(next()){
for(j=1;j<=i;j++)
g<<comb[j]<<' ';
g<<'\n';}}
f.close();
g.close();
return 0;
}
bool next(){
int j;
if(comb[i]<n){
comb[i]++;
return 1;}
for(j=i-1;j>=1&&comb[j]==n-i+j;j--);
if(!j)
return 0;
comb[j]++;
for(++j;j<=i;j++)
comb[j]=comb[j-1]+1;
return 1;}