Easy C++ 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    vector<int> evenOddBit(int n) {\n        vector<int>v;\n        int even=0;\n        int odd=0;\n        int size=log2(n)+1;\n        for(int i=0;i<size;i++)\n        {\n            if(i%2==0 && ((n&(1<<i))!=0))\n            even++;\n            if(i%2==1 && ((n&(1<<i))!=0))\n            odd++;\n        }\n        v.push_back(even);\n        v.push_back(odd);\n        return v;\n    }\n};\n```
['C++']