Pagini recente » Cod sursa (job #1402959) | Diferente pentru happy-coding-2007/solutii intre reviziile 41 si 56 | Cod sursa (job #1678984) | Cod sursa (job #1793609) | Cod sursa (job #1506714)
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,v[10];
int main()
{
freopen("permutari.out","w",stdout);
freopen("permutari.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)v[i]=i;
do
{
for(int i=1;i<=n;i++)printf("%d",v[i]);
}
while(next_permutation(v+1,v+n+1));
return 0;
}