Cod sursa(job #1707052)
| Utilizator | Data | 24 mai 2016 06:46:08 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int v[20], fol[20], n;
void gen(int p)
{
int i, j;
if(p>n)
return;
for(i=1; i<=n; i++)
if(fol[i]==0 && i>v[p-1])
{
fol[i]=1;
v[p]=i;
for(j=1; j<=p; j++)
g<<v[j]<<" ";
g<<endl;
gen(p+1);
fol[i]=0;
}
}
int main()
{
f>>n;
gen(1);
}
