C++中Goldbach猜想的Seg错误

#include <iostream>
#include <vector>

// 判断一个数是否为素数
bool isPrime(int num) {
    if (num <= 1) {
        return false;
    }
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

// 验证Goldbach猜想
void verifyGoldbachConjecture(int n) {
    if (n <= 2 || n % 2 != 0) {
        std::cout << "Invalid input! Please enter an even number greater than 2." << std::endl;
        return;
    }

    std::vector<int> primes;
    for (int i = 2; i <= n / 2; i++) {
        if (isPrime(i) && isPrime(n - i)) {
            primes.push_back(i);
            primes.push_back(n - i);
        }
    }

    if (primes.empty()) {
        std::cout << "Goldbach conjecture is not verified for " << n << "." << std::endl;
    } else {
        std::cout << "Goldbach conjecture is verified for " << n << ". Possible prime pairs are:" << std::endl;
        for (int i = 0; i < primes.size(); i += 2) {
            std::cout << primes[i] << " + " << primes[i + 1] << " = " << n << std::endl;
        }
    }
}

int main() {
    int num;
    std::cout << "Enter an even number greater than 2: ";
    std::cin >> num;
    verifyGoldbachConjecture(num);
    return 0;
}