Cod sursa(job #634735)
Utilizator | Data | 16 noiembrie 2011 23:08:37 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int i,n,p[10];
int main(){
scanf("%d", &n);
for (i=1;i<=n;++i) p[i]=i;
do{
for (i=1;i<=n;++i)
printf("%d ", p[i]);
printf("\n");
}
while(next_permutation(p+1,p+n+1));
return 0;
}