Cod sursa(job #1676853)
| Utilizator | Data | 6 aprilie 2016 10:43:01 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#define MAXN 17
#define INFILE "submultimi.in"
#define OUTFILE "submultimi.out"
using namespace std;
ifstream f(INFILE);
ofstream g(OUTFILE);
int n,v[MAXN];
bool use[MAXN];
void bkt(int k)
{
for(int j,i=v[k-1]+1;i<=n;i++)
if(!use[i])
{
use[i]=1;
v[k]=i;
for(j=1;j<=k;j++)
g<<v[j]<<" ";
g<<'\n';
if(k<n)bkt(k+1);
use[i]=0;
}
}
int main()
{
f>>n;
bkt(1);
f.close();
g.close();
return 0;
}
