Pagini recente » Cod sursa (job #2604643) | Cod sursa (job #3233540) | Cod sursa (job #3199432) | Cod sursa (job #629710) | Cod sursa (job #1359847)
#include <fstream>
#include <algorithm>
#include <vector>
std::ifstream be("damesah.in");
std::ofstream ki("damesah.out");
std::vector<int> x;
int n, db, i;
bool b;
int main()
{
be >> n;
x.resize (n);
for (i=0; i<n; i++) x[i] = i+1;
db = 0;
b = false;
do {
for (i=1; i<n; i++) if (abs (x[i]-x[i-1]) == 1) break;
if (i == n) {
if (!b) {
for (i=0; i<n; i++) ki << x[i] << " ";
b = true;
}
db++;
}
} while (std::next_permutation(x.begin(), x.end()));
ki << "\n" << db;
}