Pagini recente » Diferente pentru problema/mts intre reviziile 9 si 8 | Cod sursa (job #1158854) | Cod sursa (job #1603581) | Cod sursa (job #1282311) | Cod sursa (job #2127859)
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
int sir[10];
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
sir[i] = i + 1;
}
do{
for(int i = 0; i < n; i++){
printf("%d ", sir[i]);
}
printf("\n");
}
while(next_permutation(sir, sir + n));
return 0;
}