Pagini recente » Cod sursa (job #2156107) | Cod sursa (job #2073519) | Diferente pentru problema/pcost intre reviziile 1 si 2 | Cod sursa (job #2073994) | Cod sursa (job #416994)
Cod sursa(job #416994)
#include<stdio.h>
#include<algorithm>
using namespace std;
int v[]={0,1,2,3,4,5,6,7,8},n;
int main()
{
int i;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
do{
for(i=1;i<=n;++i) printf("%d ",v[i]); printf("\n");
}while(next_permutation(v+1,v+n+1)!=false);
return 0;
}