Two Sum + Sieve
Similar Question:\n+ 1. Two Sum\n# C++\n    vector> findPrimePairs(int n) {\n        vector prime(n + 1);\n        for(int i = 2;i <= n; ++i)\n            if(!p
# Similar Question:\n+ [1. Two Sum](https://leetcode.com/problems/two-sum/)\n# C++\n    vector<vector<int>> findPrimePairs(int n) {\n        vector<bool> prime(n + 1);\n        for(int i = 2;i <= n; ++i)\n            if(!prime[i]) \n                for(int j = 2 * i;j <= n; j += i)\n                    prime[j] = true;\n        \n        vector<vector<int>> ans;\n        for(int i = 2;i + i <= n; ++i) {\n            if(!prime[i]) {\n                int key = n - i;\n                if(key > 1 && !prime[key]) \n                    ans.push_back({i, key});\n            }\n        }\n        return ans;\n    }
['C']