Very Easy Solution C++ [With Explanation]
Firstly if we have a subset with gcd 1 then we can find the proper multiplicand which will make that subset equal to 1, so we need to check whether there exists
Firstly if we have a subset with gcd 1 then we can find the proper multiplicand which will make that subset equal to 1, so we need to check whether there exists a subset with gcd equal to 1 or not... Now if a subset has gcd 1 then if we add an element to it, it\'s gcd remains 1  so that means if a subset has gcd 1 then whole array has also gcd 1,  so check the gcd of whole array if it\'s 1 then possible otherwise not possible..\n```\nclass Solution {\npublic:\n    int gcd(int a,int b){\n        if(b==0) return a;\n        return gcd(b,a%b);\n    }\n    bool isGoodArray(vector<int>& nums) {\n        if(!nums.size()) return false;\n        if(nums.size()==1) return nums[0]==1;\n        int g=nums[0];\n        for(int i=1;i<nums.size();i++){\n            g=gcd(g,nums[i]);\n        }\n        return g==1;\n    }\n};\n```
['C', 'C++']