1、hanoi
#include <iostream>
using namespace std;
long long s = 0;
void move(int from[], int to[], int k) {
int n, i;
for (n = k; n > 0; n--) {
if (from[n - 1] == 0 || n == 1) {
for (i = k;; i--) {
if (to[i] == 0) { to[i] = from[n]; from[n] = 0; s++;
if (from[0] == 1 && to[0] == 2) { cout <<"移动圆盘"<< to[i] << ":x>>y" << endl; }
else if (from[0] == 1 && to[0] == 3) { cout << "移动圆盘" << to[i] << ":x>>z" << endl; }
else if (from[0] == 2 && to[0] == 1) { cout << "移动圆盘" << to[i] << ":y>>x" << endl; }
else if (from[0] == 2 && to[0] == 3) { cout << "移动圆盘" << to[i] << ":y>>z" << endl; }
else if (from[0] == 3 && to[0] == 1) { cout << "移动圆盘" << to[i] << ":z>>x" << endl; }
else if (from[0] == 3 && to[0] == 2) { cout << "移动圆盘" << to[i] << ":z>>y" << endl; }
break; }
}break;
}
}
}
void p(int from[], int by[], int to[], int n) {
cout << "x y z" << endl;
for (int i = 1; i <= n; i++) {
cout << from[i] << " " << by[i] << " " << to[i] << "\n";
}putchar('\n');
}
void pp(int x[], int y[], int z[], int n) {
if (x[0] == 1 && y[0] == 2 && z[0] == 3) { p(x, y, z, n); }
else if (x[0] == 1 && z[0] == 2 && y[0] == 3) { p(x, z, y, n); }
else if (y[0] == 1 && x[0] == 2 && z[0] == 3) { p(y, x, z, n); }
else if (y[0] == 1 && z[0] == 2 && x[0] == 3) { p(y, z, x, n); }
else if (z[0] == 1 && x[0] == 2 && y[0] == 3) { p(z, x, y, n); }
else p(z, y, x, n);
}
将n个圆盘移动
void hamoi(int from[], int by[], int to[], int n, int k) {
if (n == 1) { move(from, to, k); pp(from, by, to,k); }
else {
hamoi(from, to, by, n - 1, k); //将上面n-1个圆盘移动到by
move(from, to, k); pp(from, by, to,k); // 将第n个移动到to
hamoi(by, from, to, n - 1, k); // 将n-1个从by移动去to
}
}
int main()
{
int n, i;
cout << "解决几层汉诺塔问题(将x轴上圆盘全移动到z轴上,且数字小的圆盘不能放到较大的上面):";
cin >> n;
int a[60]; int b[500]; int c[500]; a[0] = 1; b[0] = 2; c[0] = 3;
for (i = 1; i <= n; i++) {
a[i] = i; b[i] = 0; c[i] = 0;
}//初始化
hamoi(a, b, c, n, n);
cout << "一共需要步数:" << s << endl;
return 0;
}
2、字符串全排列
char a[100]={0};
int s = 0;
void rswap(int x, int y) {
int t=a[x];
for (int i = x; i < y; i++) {
a[i] = a[i + 1];
}
a[y] = t;
}
void swap(int x, int y) {
int t = a[y];
for (int i = y; i > x; i--) {
a[i] = a[i - 1];
}
a[x] = t;
}
/*p之后实现全排列*/
void pp(int p, int q) {
if (p == q - 1) {
for (int i = 0; i < q; i++) {
printf("%c", a[i]);}
s++;
putchar('\n');
}
else {
for (int i=p; i < q; i++) {
swap(p,i); //依次将之后的位置放到次位置
pp(p + 1, q); // p+1之后实现全排列
rswap(p, i); //调换后又恢复原样
}
}
}
void px(int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (a[i] > a[j]) {
char ch = a[i];
a[i] = a[j];
a[j] = ch;}}
}
}
int main() {
scanf("%s", &a);
int x = (int)strlen(a);
px(x);
pp(0, x);
}
3、瓷砖铺路
int jc(int n) {
if (n == 0) return 1;
int s = 1;
for (int i = 1; i <= n; i++) {
s *= i;
}
return s;
}
int jc2(int n) {
if (n == 0)return 1;
int s = 1;
for (int i = 1; i <= n; i++) {
s *= 2;
}
return s;
}
int main()
{
int n;
while (1) {
scanf("%d", &n);
int i, c = 0;
for (i = 0; 2 * i <= n; i++) {
c += jc2(i) * (jc(n - i) / (jc(i) * jc(n - 2 * i)));
}
printf("%d\n", c);
}
return 0;
}