Pagini recente » Cod sursa (job #1019983) | Cod sursa (job #1603068) | Cod sursa (job #2273100) | Cod sursa (job #1346155) | Cod sursa (job #872771)
Cod sursa(job #872771)
#include<cstdio>
#define maxn 101
int n ;
int sel[maxn], sol[maxn] ;
void back(int level)
{
if( n + 1 == level )
{
for(int i = 1; i <= n; ++i )
printf("%d ", sol[i]);
printf("\n");
return ;
}
for(int i = 1; i <= n; ++i )
{
if( sel[i] == 0 )
{
sel[i] = 1 ;
sol[level] = i ;
back( level + 1 ) ;
sel[i] = 0 ;
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d%d", &n);
back(1) ;
return 0 ;
}