Cod sursa(job #840372)
| Utilizator | Data | 22 decembrie 2012 15:04:18 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
#include<algorithm>
#define NMAX 10
using namespace std;
ifstream f("permutari.in"); ofstream g("permutari.out");
short n, v[NMAX];
int main()
{
f>>n;
for(int i = 1; i <= n; ++i) v[i - 1] = i;
do
{
for(int i = 0; i < n; ++i) g<<v[i]<<' ';
g<<'\n';
}
while(next_permutation(v, v + n));
g.close();
return 0;
}
