河内塔算法
#include<stdio.h>
void hanoi(int n, char A, char B, char C)
{
if (n == 1)
{
printf(“Move sheet %d form %c to %c\n”, n, A, C);
}
else
{
hanoi(n - 1, A, C, B);
printf(“Move sheet %d form %c to %c\n”, n, A, C);
hanoi(n - 1, B, A, C);
}
}
int main()
{
int n;
printf(“请输入盘数:”);
scanf_s("%d", &n);
hanoi(n, ‘A’, ‘B’, ‘C’);
return 0;
}
费式数列
#include<stdio.h>
#include<stdlib.h>
#define N 20
int main()
{
int Fib[N] = { 0 };
int i;
Fib[0] = 0;
Fib[1] = 1;
for (i = 2; i < N; i++)
{
Fib[i] = Fib[i - 1] + Fib[i - 2];
}
for (i = 0; i < N; i++)
{
printf("%d", Fib[i]);
printf("\n");
}
return 0;
}
- 正在更新 小伙伴们不要着急