题解 | #找位置#

#include <iostream>
#include<map>
#include<vector>
#include<string>
using namespace std;
map<char,vector<string>> m;
vector<char> v;
int main() {
    string s;
    while(cin>>s){
        for(int i=0;i<s.size();i++){
            if(m.find(s[i])==m.end()) {v.push_back(s[i]);m[s[i]].push_back(to_string(i));}
            else m[s[i]].push_back(to_string(i));
        }
        for(int i=0;i<v.size();i++){
            if(m[v[i]].size()<2) continue;
            char c=v[i];
            for(int j=0;j<m[v[i]].size()-1;j++){
                cout<<c<<':'<<m[v[i]][j]<<',';
            }
            cout<<c<<':'<<m[v[i]][m[v[i]].size()-1]<<endl;
        }
    }
}
// 64 位输出请用 printf("%lld")