100%beats
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    int maxSubarrays(vector<int>&a) {\n        int k=a[0];\n        int ans=0;\n        for(int i=1;i<a.size();i++){\n            k&=a[i];\n        }\n\n       if(k!=0)return 1;\n        int q=INT_MAX;\n\n        for(int i=0;i<a.size();i++){\n              q&=a[i];\n         if(q==0){ ans++;q=INT_MAX; }\n         }\n      \n        return ans;\n    }\n};\n```
['Greedy', 'Bit Manipulation', 'C++']