第五章例题

稍微测试了一下cin的用法和字节流的用法

#include <iostream>
#include <string>
#include <set>
#include <sstream>
using namespace std;


int main() {

/*

    //cin>>和ss读字符串时跳过前面的空白符,当再次回车时从相应的缓冲区读入

 
    string s="    lanti    anci";
    string buf;

    stringstream ss(s);

    while(ss>>buf)
        cout<<buf;

    cout<<endl;

*/

    string s;
    cin>>s;

    cout<<s<<endl;

    return 0;
}

5-3

#include <iostream>
#include <sstream>
#include <string>
#include <set>

using namespace std;

set<string> dict;

int main()
{
    string s,buf;

    while(cin>>s)
    {
        for(unsigned int i=0;i<s.length();i++)
        {
            if(isalpha(s[i]))
                s[i]=tolower(s[i]);
            else
                s[i]=' ';
        }

        stringstream ss(s);

        ss >> buf; 
        dict.insert(buf);
    }

    for(set<string>::iterator it=dict.begin();it!=dict.end();it++)
        cout<<*it<<endl;

    return 0;
}

 5-4

#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <algorithm>
#include <set>

using namespace std;

vector<string> words_v;
map<string,int> st_w;


string per(string& st)
{
    string temp=st;

    for(unsigned int i=0;i<st.length();i++)
        temp[i]=tolower(temp[i]);

    sort(temp.begin(),temp.end());

    return temp;
}


int main()
{
    string word;

    while(cin>>word)
    {    
        if(word[0]=='#')
            break;

        words_v.push_back(word);
        string temp=per(word);

        if(!st_w.count(temp))
            st_w[temp]=1;
        else
            st_w[temp]++;
    }

    set<string> ans;

    for(unsigned int vit=0;vit<words_v.size();vit++)
        if(st_w[per(words_v[vit])]==1)
            ans.insert(words_v[vit]);

    //sort(ans.begin(),ans.end());    

    for(set<string>::iterator it = ans.begin(); it != ans.end(); ++it)
        cout<<*it<<endl;    

    return 0;    
}

5-5

#include <cstdio>
#include <iostream>
#include <stack>
#include <set>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())                       //注意宏的括号和inserter 

typedef set<int> Set;
map<Set,int> IDcache;
vector<Set> Setcache;
stack<int> s;


int ID(Set x)
{
    if(IDcache.count(x))
        return IDcache[x];                                //如果存在集合就返回对应的值
    Setcache.push_back(x);
    return IDcache[x]=Setcache.size()-1;                  //不存在该集合,就加入Setcache中然后返回对应的值
}


int main()
{
    int n;
    cin>>n;

    while(n--)
    {
        int m;
        cin>>m;

        for(int i=0;i<m;i++)
        {
            string op;
            cin>>op;

            if(op[0]=='P')
                s.push(ID(Set()));                       //如果是PUSH就获得其对应的ID压栈
            else if(op[0]=='D')
                s.push(s.top());                         //如果是DUP就把栈顶元素在压入栈中
            else
            {
                Set x1=Setcache[s.top()];
                s.pop();                                 
                Set x2=Setcache[s.top()];
                s.pop();
                Set x;
                if(op[0]=='U')
                    set_union(ALL(x1),ALL(x2),INS(x));                         //并集
                if(op[0]=='I')
                    set_intersection(ALL(x1),ALL(x2),INS(x));                  //交集
                if(op[0]=='A')
                {
                    x=x2;
                    x.insert(ID(x1));                                         //插入元素
                }
                s.push(ID(x));
            }

            cout<<Setcache[s.top()].size()<<endl;
        }

        cout<<"***"<<endl;
    }
}

5-6

#include <iostream>
#include <queue>
#include <map>

using namespace std;

const int maxn=1000;

queue<int> bigq;
queue<int> myqueue[maxn];
map<int,int> team;

int main()
{

    /*输入每个团队中每个人的编号*/
    int t;
    cin>>t;

    while(t--)
    {    
        cout<<"***"<<endl;
        
        int queID;
        cin>>queID;

        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            int memID;
            cin>>memID;
            team[memID]=queID;
        }
    }

    /*模拟操作*/

    for(;;)
    {
        string op;
        
        cin>>op;

        if(op[0]=='S')
            break;


        int memID;
        int queID;

        if(op[0]=='E')
        {
            cin>>memID;

            queID=team[memID];

            if(myqueue[queID].empty())
            {
                bigq.push(queID);
                myqueue[queID].push(memID);
            }
            else
            myqueue[queID].push(memID);
        }

        if(op[0]=='D')
        {
            queID=bigq.front();

            memID=myqueue[queID].front();
            myqueue[queID].pop();

            if(myqueue[queID].empty())
                bigq.pop();

            cout<<memID<<endl;
        }

    }

    return 0;
}

5-7

#include <iostream>
#include <queue>
#include <map>

using namespace std;

const int maxn=1000;

queue<int> bigq;
queue<int> myqueue[maxn];
map<int,int> team;

int main()
{

    /*输入每个团队中每个人的编号*/
    int t;
    cin>>t;

    while(t--)
    {    
        cout<<"***"<<endl;
        
        int queID;
        cin>>queID;

        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            int memID;
            cin>>memID;
            team[memID]=queID;
        }
    }

    /*模拟操作*/

    for(;;)
    {
        string op;
        
        cin>>op;

        if(op[0]=='S')
            break;


        int memID;
        int queID;

        if(op[0]=='E')
        {
            cin>>memID;

            queID=team[memID];

            if(myqueue[queID].empty())
            {
                bigq.push(queID);
                myqueue[queID].push(memID);
            }
            else
            myqueue[queID].push(memID);
        }

        if(op[0]=='D')
        {
            queID=bigq.front();

            memID=myqueue[queID].front();
            myqueue[queID].pop();

            if(myqueue[queID].empty())
                bigq.pop();

            cout<<memID<<endl;
        }

    }

    return 0;
}