Pagini recente » Cod sursa (job #3275595) | Cod sursa (job #1358511) | Cod sursa (job #1764586) | Cod sursa (job #2795206) | Cod sursa (job #1680724)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int v[10], n;
void back(int k){
int i, j;
bool ok;
if (k == n){
for (i = 1; i <= n; i++){
fout << v[i] << ' ';
}
fout << endl;
} else{
for (i = 1; i <=n; i++){
ok = true;
for (j = 1; j <= k; j++){
if (v[j] == i){
ok = false;
break;
}
}
if (ok){
v[k+1] = i;
back(k+1);
}
}
}
}
int main(){
fin >> n;
back(0);
return 0;
}