#include #include #include using namespace std; bool isPrime(int x) { if (x < 2) return false; for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) return false; } return true; } int main() { int m, n; cin >> m >> n; if (m > n) swap(m, n); int count = 0; for (int num = m; num <= n; num++) { if (num % 2 != 0) continue; for (int i = 2; i <= num / 2; i++) { if (isPrime(i) && isPrime(num - i)) { cout << i << "+" << (num - i) << "=" << num << endl; count++; } } } cout << count << endl; return 0; }