c++ 递归训练

#include <iostream>
using namespace std;
int f(int n)
{
   
	if (n <=2)//递归结束条件
		return n;
	else
		return f(n - 1) + f(n - 2);
}
int main()
{
   
	int n;
	cin >> n;
	cout << f(n);
}

#include<iostream>
#include<cstring>
using namespace std;
int row, col;
int germ[102][102];
void search(int x, int y) {
   
	//将该菌落标记为已计数状态
	germ[x][y] = -1;
	//按照右上左下的顺序
	if (germ[x + 1][y] == 1)
		search(x + 1, y);
	if (germ[x][y + 1] == 1)
		search(x, y + 1);
	if (germ[x - 1][y] == 1)
		search(x - 1, y);
	if (germ[x][y - 1] == 1)
		search(x, y - 1);
}
int main() {
   
	int count = 0;
	cin >> row >> col;
	for (int i = 0; i < row; i++)
		for (int j = 0; j < col; j++)
			cin >> germ[i][j];
	for (int i = 0; i < row; i++) {
   
		for (int j = 0; j < col; j++) {
   
			if (germ[i][j] == 1) {
   
				count++;
				search(i, j);
			}
		}
	}
	cout << count << endl;
	return 0;
}

#include<iostream>
using namespace std;
int a[100][100];
int n, m;
bool search(<