#include<iostream>#
include
#include<fstream>#
include
#include<vector>#
include
#include<map>#
include#includeusing namespace std;bool has_punct = false;using namespace::std;string c,d,s1,s2,s3,s4,s5,s6,s7,s8;string::size_type l,m,n,o;vectorcat;vectordog;map guanzi;int y,z;pair::iterator,bool> ret;int guess(string s9)//有多少个空格键{int guessnumber=0;for(m=0;msecond; s4=s6; s5=s3.substr(count+1); while(guess(s5)) { digui(s5); }}int main(){ifstream f1;ifstream f2;string in;string out;cout<<"请输入要打开的文档的地址"<>in;cout<<"请输入要打开的字典的地址"<>out;f1.open(in);if(!f1)(cout<<"打开文档失败"<127的存在 { s1[j]=' '; } }if(guess(s1)!=0)//主要检测是不是只有一个单词，如果只有一个单词进递归的话会报string数组越界=_=！！ {digui(s1); ret=guanzi.insert(make_pair(s5,1)); if(!ret.second) ++ret.first->second; }else ret=guanzi.insert(make_pair(s1,1)); if(!ret.second) ++ret.first->second;}while(!f2.eof()) { getline(f2,s2,' '); dog.push_back(s2); }for(l=0;l::iterator it=guanzi.find(dog[l]);if(it==guanzi.end()) { cout<second; cout<