基本思想:
无;
关键点:
无;
#include<iostream> #include<string> #include<vector> #include<map> using namespace std; int main() { string s; while (cin>>s){ map<string, int>mp; for (int l = 0; l < s.size(); l++) { //l为子串长度 for (int i = 0; i + l - 1 < s.size(); i++) { int left = i; int right = i + l - 1; string str = s.substr(left, right - left + 1); mp[str]++; } } for (auto it = mp.begin(); it != mp.end(); it++) { if (it->second > 1) cout << it->first << " " << it->second << endl; } } return 0; }