C++ Very Simple solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n\n    vector<vector<int>> findPrimePairs(int n) {\n        vector<vector<int>>ans;\n        vector<bool> v(n+1,1);\n        v[0]=v[1]=0;\n        for(int i=2;i<=sqrt(n);i++){\n            if(v[i]){\n                for(int j=i*i;j<=n;j+=i){\n                    v[j]=0;\n                }\n            }\n        }\n        for(int x=2;x<=n/2;x++){\n            int y=n-x;\n            if(v[x]&& v[y]){\n                if(x+y == n)ans.push_back({x,y});      \n            }\n        }\n        return ans;\n    }\n};\n```
['C++']