牛客-是不是復讀機(map,set的應用)

題目鏈接
tip:
1 set (string) 讀入" “時候,輸入會變成”"
2可以注意有多個空格
3使用map來記錄cnt

#include<bits/stdc++.h>
using namespace std;
const int inf= 0x3f3f3f3f;
typedef long long ll;
set<string>cn;
map<string,int>m1,m2;
int main()
{
    string s1,s2,t;
    getline(cin,s1);
    getline(cin,s2);
    int l1 = s1.size();
    int l2 = s2.size();
    for(int i=0;i<l1;i++)
    {
        if(s1[i]!=' ')
        {
            if(s1[i]>='A'&&s1[i]<='Z') s1[i] = s1[i] - 'A' + 'a';
            t+=s1[i];
         }
        else{
            if(m1[t]) m1[t]++;
            else m1[t]=1;
            cn.insert(t);
            t.clear();
        }
    }
    if(m1[t]) m1[t]++;
            else m1[t]=1;
    cn.insert(t);
    t.clear();
    for(int i=0;i<l2;i++)
    {
        if(s2[i]!=' ')
        {
            if(s2[i]>='A'&&s2[i]<='Z') s2[i] = s2[i] - 'A' + 'a';
            t+=s2[i];
         }
        else{
            if(m2[t]) m2[t]++;
            else m2[t]=1;
            cn.insert(t);
            t.clear();
        }
    }
    if(m2[t]) m2[t]++;
            else m2[t]=1;
            cn.insert(t);
    set<string>::iterator it = cn.begin();
    double s =0,a=0,b=0;
    while(it!=cn.end())
    {
        if(*it!="")
        {
            s += m1[*it]*m2[*it];
            a+=m1[*it]*m1[*it];
            b+=m2[*it]*m2[*it];
        }
        it++;
    }    // ans  a/(sqrt(a)*sqrt(b))
    double ans = s/(sqrt(a)*sqrt(b));
    if(ans>=0.9000) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}