C++ REAL clear 8ms solution, beats 100%!
```\n    vector ambiguousCoordinates(string S) {\n        vector res;\n        for(int i=1;i<S.size()-2;i++) {\n            vector left=makeNum(S.substr(1, i));
```\n    vector<string> ambiguousCoordinates(string S) {\n        vector<string> res;\n        for(int i=1;i<S.size()-2;i++) {\n            vector<string> left=makeNum(S.substr(1, i));\n            vector<string> right=makeNum(S.substr(i+1, S.size()-2-i));\n            for(int m=0;m<left.size();m++) {\n                for(int n=0;n<right.size();n++) res.push_back("("+left[m]+", "+right[n]+")");\n            }\n        }\n        return res;\n    }\n    \n    vector<string> makeNum(string num) {\n        vector<string> res;\n        if(num[0]!=\'0\'||num.size()==1) res.push_back(num);\n        for(int i=0;i<num.size()-1;i++) {\n            if((num[0]==\'0\'&&i!=0)||num.back()==\'0\') continue;\n            res.push_back(num.substr(0, i+1)+"."+num.substr(i+1));\n        }\n        return res;\n    }
[]