Pagini recente » Profil florinhaja | Cod sursa (job #1762479) | Cod sursa (job #1687956) | Cod sursa (job #1789991) | Cod sursa (job #1880334)
# include <cstdio>
using namespace std;
int n,uz[10],sol[10];
void back (int k)
{
if (k==n+1) {
for (int i=1; i<=n; ++i)
printf ("%d ", sol[i]);
printf ("\n");
}
else {
for (int i=1; i<=n; ++i)
if (uz[i]==0)
{
uz[i]=1;
sol[k]=i;
back(k+1);
sol[k]=0;
uz[i]=0;
}
}
}
int main ()
{
freopen ("permutari.in", "r", stdin);
freopen ("permutari.out", "w", stdout);
scanf ("%d", &n);
back (1);
return 0;
}