Pagini recente » Cod sursa (job #2624937) | Cod sursa (job #10205) | Cod sursa (job #2131415) | Cod sursa (job #2999638) | Cod sursa (job #3132936)
#include <bits/stdc++.h>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
const int N = 18;
int n,k,s[N];
void bkt(int,int);
int main()
{
f>>n;
bkt(1,1);
return 0;
}
void bkt(int p,int k)
{
if(k==n+1)
return;
/// generez solutie partiala
/// varianta 1 : pun numarul k in submultime
/// si in acest caz, am o noua multime
/// pe care o afisez
s[p]=k;
for(int j=1;j<=p;j++)
g<<s[j]<<' ';
g<<'\n';
bkt(p+1,k+1);
/// varianta 2 : nu pun numarul k in submultime
bkt(p,k+1);
}