Cod sursa(job #2433665)
Utilizator | Data | 28 iunie 2019 15:12:28 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define Nmax 10
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int N;
int Array[Nmax];
int main()
{
fin >> N;
for(int i = 1; i <= N; ++i)
Array[i] = i;
do
{
for(int i = 1; i <= N; ++i)
fout << Array[i] << " ";
fout << "\n";
} while(next_permutation(Array + 1, Array + N + 1));
return 0;
}