Pagini recente » Cod sursa (job #2385248) | Borderou de evaluare (job #1172123) | Borderou de evaluare (job #1791684) | Borderou de evaluare (job #1183611) | Cod sursa (job #2301792)
#include<cstdio>
short n,k,p[9];
bool u[9];
void A(short k)
{
if(k-1==n)
{
for(short i=1;i<=n;i++)
printf("%hd ",p[i]);
printf("\n");
}
else
{
for(short i=1;i<=n;i++)
if(u[i]==false)
p[k]=i,u[i]=true,A(k+1),u[i]=false;
}
}
int main()
{
freopen("permutari.in","r",stdin),freopen("permutari.out","w",stdout),scanf("%hd",&n),A(1);
}