金字招牌

1
#include <iostream>
2

3
using namespace std;
4

5
long long fun(long long n); //函数的声明
6

7
int main()
8
{
9
  long long num ;
10

11
  cin>>num;
12
  if(num<0)  cout<<"input error"<<endl;
13
  else  cout<<fun(num)<<endl;          //函数的调用
14

15
}
16

17
long long fun(long long n)  //阶乘计算
18
{
19
  if(n<0)       //非法输入
20
    return -1;
21
  else if(n==0||n==1)  //边界
22
    return 1;
23
  else
24
    return n*fun(n-1);  //算阶乘
25
}

1
#include<iostream>
2
using namespace std;
3
void reverse(int num)
4
{
5
  if(num<0)
6
  {
7
    cout<<'-';
8
    reverse(-num);
9
  }
10
  else if(num==0)
11
  {
12
    return;
13
  }
14
  else
15
  {
16
    cout<<num%10;
17
    reverse(num/10);
18
  }
19

20
  return;
21
}
22

23
int main()
24
{
25
  int n;
26

27
  cin>>n;
28
  if(n==0)
29
    cout<<0;
30
  else
31
    reverse(n);
32
  return 0;
33
}

1
#include<iostream>
2

3
using namespace std;
4

5
float fun(float x, int n) //迭代法
6
{
7
  float result=1.0;
8

9
  while(n--)  result*=x;
10

11
  return result;
12
}
13

14
float fun_2(float x, int n) //递归法
15
{
16
  float result=1.0;
17

18
  if(n==0)
19
    result=1.0;
20
  else
21
    result=x*fun_2(x,n-1);
22
  return result;
23
}
24

25
int main()
26
{
27
  //验证三天打鱼两天晒网 小于1.01
28
  if(fun_2(1.01, 3)*fun_2(0.99, 2)<1.01)
29
    cout<<"True"<<endl;
30
  else
31
    cout<<"False"<<endl;
32

33
  int n;
34
  float x;
35

36
  cin>>x>>n;
37
  cout<<fun_2(x,n)<<endl;
38

39
  return 0;
40
}

1
#include <iostream>
2
#include <string>
3
#include <cmath>
4

5
using namespace std;
6

7
// 前向声明函数
8
void hanoi(int n, char a, char b, char c);
9
void move(int n, char sourcePeg, char destinationPeg);
10

11
void hanoi(int n, char a, char b, char c) {
12
  // 基本情况：如果只有一个盘子 (n=1)，直接从 A 移动到 B
13
  if (n == 1) {
14
    move(1, a, b);
15
    return; // 递归结束，返回上一层调用
16
  }
17

18
  // 递归步骤 1: 将 n-1 个盘子从源柱 (a) 移动到辅助柱 (c)，目标是 c
19
  hanoi(n - 1, a, c, b);
20

21
  // 递归步骤 2: 将最大的第 n 个盘子从源柱 (a) 直接移动到目标柱 (b)
22
  move(n, a, b);
23

24
  // 递归步骤 3: 将 n-1 个盘子从辅助柱 (c) 移动到目标柱 (b)，目标是 b
25
  hanoi(n - 1, c, b, a);
26
}
27

28
void move(int n, char sourcePeg, char destinationPeg) {
29
  cout << "Move disk " << n << " from " << sourcePeg << " to " << destinationPeg << endl;
30
}
31

32
int main() {
33
  int n;
34
  cout << "=========================================" << endl;
35
  cout << "       Tower of Hanoi Solver (Recursive)  " << endl;
36
  cout << "=========================================" << endl;
37

38
  cout << "Input the Number of Disks (N): ";
39
  cin >> n;
40

41
  if (n <= 0) {
42
    cout << "Invalid input. Please enter a positive integer." << endl;
43
    return 1;
44
  }
45

46
  cout << "\n--- Solution Steps ---" << endl;
47
  cout << "Steps of moving " << n << " disks from A to B by means of C:" << endl;
48

49
  hanoi(n, 'A', 'B', 'C');
50

51
  cout << "\n=========================================" << endl;
52
  cout << "Total moves required: " << (long long)pow(2, n) - 1 << endl;
53
  cout << "=========================================" << endl;
54

55
  return 0;
56
}