Easy Math and Graph Solution || C++
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```\n#define ll long long int\nclass Solution {\n    public:\n    void dfs(vector<vector<int>> &adj,vector<bool> &visited,int &c,int &i) {\n        visited[i]=true;\n        c++;\n        for(auto it:adj[i]) {\n            if(!visited[it])\n                dfs(adj,visited,c,it);   \n        }\n    }\n\n    int maximumDetonation(vector<vector<int>>& bombs) {\n\n        int n=bombs.size();\n        vector<vector<int> > adj(n);\n        for(int i=0;i<n;i++) {\n            ll x1,y1,r1;\n            x1=bombs[i][0];\n            y1=bombs[i][1];\n            r1=bombs[i][2];\n            for(int j=0;j<n;j++) {\n                if(i!=j) {\n                    ll x,y;\n                    x=abs(x1-bombs[j][0]);\n                    y=abs(y1-bombs[j][1]);\n                    if(x*x+y*y<=r1*r1)\n                        adj[i].push_back(j);\n                }\n            }\n        }\n\n        int ans=INT_MIN;\n        for(int i=0;i<n;i++) {\n            int c=0;\n            vector<bool> visited(n,false);\n            dfs(adj,visited,c,i);\n            ans=max(ans,c);\n        }\n\n        return ans;\n    }\n};\n```
['C++']