Pagini recente » Cod sursa (job #2962954) | Cod sursa (job #2374631) | Cod sursa (job #1825051) | Cod sursa (job #1028102) | Cod sursa (job #743836)
Cod sursa(job #743836)
#include<iostream>
#include<math.h>
#include<fstream>
#include<string.h>//hallo
#include<stdio.h>
using namespace std;
int n, st[100], k;
void back(int k)
{
if(k == n+1)
{
for(int i=1; i<=n; i++)
printf("%d ", st[i]);
printf("\n");
}
else
{
st[k] = 0;
while(st[k] < n)
{
st[k]++;
int ok = 1;
for(int i=1; i<k; i++)
if(st[i] == st[k])
ok = 0;
if(ok == 1)
back(k+1);
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(1);
return 0;
}