Pagini recente » Cod sursa (job #2150879) | Cod sursa (job #1291087) | Cod sursa (job #2017000) | Cod sursa (job #1138482) | Cod sursa (job #1967071)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
#define nmax 10
int n, st[nmax];
void afisare()
{
for(int i=1; i<=n; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
void initializare()
{
for(int i=1; i<=n; i++)
st[i]=i;
}
int main()
{
fin>>n; fin.close();
initializare();
do
{
afisare();
}while(next_permutation(st+1, st+1+n));
fout.close();
return 0;
}