SIMPLE SOLUTION--> ALWAYS TRY TO MAKE 0
\n\n# Code\n\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n         \n        int i=0;\n        int j =0;\n        int n = nums.size();
\n\n# Code\n```\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n         \n        int i=0;\n        int j =0;\n        int n = nums.size();\n        int ans =0;\n        int currand = nums[0];\n        while(j<n){\n            currand  = currand&nums[j];\n            if(currand==0){\n                ans++;\n                if(j<n-1){\n                    currand = nums[++j];\n                }else{\n                     j++;\n                }\n               \n            }else{\n                j++;\n            }\n            \n        }\n        if(ans ==0){\n            return 1;\n        }\n        return ans;\n\n    }\n};\n```
['C++']