Cod sursa(job #1193144)
Utilizator | Tudor Costin Razvan Zenus | Data | 31 mai 2014 01:11:06 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int N,i,j,F=1;
vector < int > A;
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&N);
for (i=1;i<=N;++i)
{
F*=i;
A.push_back(i);
}
for (i=1;i<=N;++i) printf("%d ",i);
printf("\n");
for (i=1;i<=F-1;++i)
{
next_permutation(A.begin(),A.end());
for (j=0;j<N;++j) printf("%d ",A[j]);
printf("\n");
}
return 0;
}