Pagini recente » Cod sursa (job #881581) | Cod sursa (job #2803710) | Cod sursa (job #775878) | Cod sursa (job #2500069) | Cod sursa (job #342265)
Cod sursa(job #342265)
#include <iostream>
#include <cstdio>
using namespace std;
int A[8];
bool vis[9];
int n;
void back(int i,int k) {
if (k == n) {
for (int j=0;j<n;++j) printf("%d ",A[j]);
printf("\n");
} else {
for (int j=1;j<=n;++j) {
if (!vis[j]) {
vis[j] = true;
A[k] = j;
back(j,k+1);
vis[j] = false;
}
}
}
}
int main() {
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
for (int i=0;i<=n;++i) vis[i] = false;
for (int i=1;i<=n;++i) { A[0] = i; vis[i] = true; back(i,1); vis[i] = false;}
fclose(stdin);
fclose(stdout);
return 0;
}