poj: 2262

简单题

 #include <iostream>
 #include <stdio.h>
 #include <string>
 #include <stack>
 #include <map>
 #include <vector>
 #include <algorithm>
 using namespace std;

 bool isPrime(int n) {
     ) return true;
      ==  || n == ) return false;
     ; i*i <= n; ++i) {
         ) return false;
     }
     return true;
 }

 int main()
 {
     int N;
     while (cin >> N && N) {
         bool flag = false;
         ; i <= N/; i+=) {
             if (isPrime(i) && isPrime(N-i)) {
                 flag = true;
                 cout << N << " = " << i << " + " << N-i << endl;
                 break;
             }
         }
         if (!flag) cout << "Goldbach's conjecture is wrong." << endl;
     }

     ;
 }