Pagini recente » Borderou de evaluare (job #3120285) | Cod sursa (job #2372080) | Borderou de evaluare (job #1538384) | Cod sursa (job #832497) | Cod sursa (job #689403)
Cod sursa(job #689403)
#include <cstdio>
using namespace std;
int x[10],n,i;
bool viz[10];
void permut(int k) {
if (k<=n) {
for (int i=1;i<=n;i++) {
x[k]=i;
if (!viz[i]) {
viz[i]=true;
permut(k+1);
viz[i]=false;
}
}
}
else {
for (int i=1;i<=n;i++) printf("%d ",x[i]);
printf("\n");
}
}
int main() {
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
permut(1);
return 0;
}