1157：哥德巴赫猜想

通过代码：

#include <bits/stdc++.h>
#define primeNum 25
using namespace std;
const int prime[] = { 0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };
bool isPrime(int _n) {
    for(int i = 1; i <= primeNum; i ++)
        if(_n == prime[i]) return true;
    return false;
}
int main() {
    for(int i = 6; i <= 100; i += 2) {
        for(int j = 1; j <= primeNum; j ++)
            if(isPrime(i - prime[j])) {
                printf("%d=%d+%d\n", i, prime[j],i - prime[j]); break;
            }
    }
    return 0;
}