Write a program to generate the Fibonacci sequence using recursion and find the number that are perfect square.

#include <iostream>
#include <cmath>
using namespace std;

// Recursive function for Fibonacci
int fib(int n) {
    if (n == 0)
        return 0;
    else if (n == 1)
        return 1;
    else
        return fib(n - 1) + fib(n - 2);
}

// Function to check perfect square
bool isPerfectSquare(int num) {
    int root = sqrt(num);
    return (root * root == num);
}

int main() {
    int n, count = 0;

    cout << "Enter number of terms: ";
    cin >> n;

    cout << "\nFibonacci Series:\n";
    for (int i = 0; i < n; i++) {
        int f = fib(i);
        cout << f << " ";

        if (isPerfectSquare(f)) {
            count++;
        }
    }

    cout << "\n\nNumber of Fibonacci numbers that are perfect squares: "
         << count << endl;

    return 0;
}