Solution in 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```\nclass Solution {\npublic:\n    #define ll long long\n    void dfs(int src,vector<int>& vis,vector<int> adj[])\n    {\n        vis[src]=1;\n        for(int x:adj[src])\n        {\n            if(vis[x]==0)\n            {\n                dfs(x,vis,adj);\n            }\n        }\n    }\n    int maximumDetonation(vector<vector<int>>& bombs) \n    {\n          int n=bombs.size();\n          vector<int> adj[n];\n        for(int i=0;i<n;i++)\n        {\n            ll r1=bombs[i][2];\n            ll x1=bombs[i][0];\n            ll y1=bombs[i][1];\n            for(int j=0;j<n;j++)\n            {\n                if(i!=j)\n                {\n                    ll x2=bombs[j][0];\n                    ll y2=bombs[j][1];\n                    ll r2=bombs[j][2];\n                    ll dsq=(x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);;\n                    if(dsq<=r1*r1)\n                    {\n                        adj[i].push_back(j); \n                    }\n                }\n            }\n        }\n        vector<int> vis(n);\n        int ans=0;\n        for(int i=0;i<n;i++)\n        {\n            dfs(i,vis,adj); \n            int cnt=0;\n            for(int j=0;j<n;j++) \n              if(vis[j]==1) cnt++;\n            ans=max(ans,cnt);\n            fill(vis.begin(),vis.end(),0);\n        }\n        return ans;\n    }\n};\n```
['C++']