Pagini recente » Cod sursa (job #2005261) | Istoria paginii moisil-2017/1112 | Monitorul de evaluare | Cod sursa (job #2767929) | Cod sursa (job #161314)
Cod sursa(job #161314)
#include<stdio.h>
#define nmax 10
int n, s[nmax];
void read()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
}
void print()
{
for(int i=1; i<=n;++i)
printf("%d ",s[i]);
printf("\n");
}
int valid (int k)
{
for(int i=1;i<=k-1;++i)
if(s[i]==s[k])
return 0;
return 1;
}
void bec(int k)
{
for(int i=1; i<=n; ++i)
{
s[k]=i;
if(valid(k)==1)
{
if(k==n)
print();
else
bec(k+1);
}
}
}
int main()
{
read();
bec(1);
return 0;
}