Pagini recente » Cod sursa (job #3289048) | Cod sursa (job #2005617) | Cod sursa (job #2283845) | Cod sursa (job #199261) | Cod sursa (job #1594750)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, k, v[10];
void afisare(){
for (int i = 1; i <= n; i++)
fout << v[i] << " ";
fout << '\n';
}
bool check(int k){
for (int i = 1; i <= k - 1; i++)
if (v[i] == v[k]) return 0;
return 1;
}
void back(int k){
for (int i = 1; i <= n; i ++){
v[k] = i;
if (check(k)){
if (k == n)
afisare();
else
back(k + 1);
}
}
}
int main()
{
fin >> n;
back(1);
return 0;
}