Pagini recente » Cod sursa (job #2966498) | Cod sursa (job #80089) | Cod sursa (job #1187488) | Cod sursa (job #129699) | Cod sursa (job #151290)
Cod sursa(job #151290)
#include <iostream>
int main ()
{
int S[9],n,t,i,U[9];
memset ( S , 0 , 36 );
memset ( U , 0 , 36 );
fscanf ( fopen("permutari.in","r") , "%d" , &n );
freopen ( "permutari.out" , "w" , stdout );
for (int t=1 ; t ; )
{
if (t>n)
{
for (i=1 ; i<n ; i++)
printf ("%d " , S[i]);
printf ("%d\n" , S[i]);
t--;
}
else
{
for (U[S[t]++]=0;U[S[t]]&&(S[t]<=n);S[t]++);
if (S[t]>n) S[t--]=0; else U[S[t++]]=1;
}
}
return 0;
}