Pagini recente » Cod sursa (job #2778085) | Cod sursa (job #166590) | Cod sursa (job #410049) | Cod sursa (job #2102090) | Cod sursa (job #1497449)
#include <iostream>
using namespace std;
int st[100],n,k;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
void afisare(int p)
{ for(int i=1;i<=n;i++)
fout<<st[i]<<" ";
fout<<'\n';
}
int solutie(int p)
{ if(p==k)
return 1;
return 0;
}
void back(int p)
{for(int pval=st[p-1]+1;pval<=n;pval++)
{ st[p]==pval;
if (solutie(p)) afisare(p);
else
back(p+1);}
}
int main()
{ int i;
fin>>n;
for(k=1;k<=n;k++)
back(1);
fout<<i<<" "<<n<<" ";
return 0;
}