Cod sursa(job #1806765)
| Utilizator | Data | 15 noiembrie 2016 17:56:53 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n, v[20];
void combinari(int x, int n)
{
for(int i=1;i<=n;i++)
{
if(i<=x)
v[i]=0;
else
v[i]=1;
}
do
{
for(int i=1;i<=n;i++)
{
if(v[i]==0)
g<<i<<' ';
}
g<<'\n';
}while(next_permutation(v+1, v+n+1));
cout<<endl;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
combinari(i, n);
}
return 0;
}
