Pagini recente » Borderou de evaluare (job #1268428) | Borderou de evaluare (job #2380931) | Borderou de evaluare (job #1467786) | Borderou de evaluare (job #2196352) | Cod sursa (job #1549903)
#include <cstdio>
using namespace std;
int st[10],fol[10];
int n;
void back(int k){
for(int i = 1; i <= n; i++){
if(fol[i] == 0){
fol[i] = 1;
st[k] = i;
if(k == n){
for(int j = 1; j <= n; j++){
printf("%d ",st[j]);
}
printf("\n");
}else
back(k + 1);
fol[i] = 0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}