Pagini recente » Borderou de evaluare (job #931169) | Diferente pentru problema/apm intre reviziile 12 si 39 | Cod sursa (job #2468805) | Borderou de evaluare (job #3035215) | Cod sursa (job #681078)
Cod sursa(job #681078)
using namespace std;
#include<cstdio>
#include<algorithm>
int v[10];
int main()
{
int n,i;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
v[i]=i;
do
{
for(i=1;i<=n;i++)
printf("%d ",v[i]);
printf("\n");
} while(next_permutation(v+1,v+n+1));
return 0;
}