第五章例题

 5-8

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>


using namespace std;

int const maxn=60;

vector<string> stv;

void print(string myst,unsigned len,char exch)
{
    cout<<myst;

    for(unsigned i=0;i<len-myst.length();i++)
        cout<<exch;
}


int main()
{
    int n,dec;
    unsigned maxlen=0;

    cin>>n;
    dec=n;

    /*数据输入*/

    while(dec--)
    {
        string temp;

        cin>>temp;
        stv.push_back(temp);
        maxlen=max(maxlen,temp.length());
    }


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

    /*计算cols和rows*/
    print("",maxn,'-');

    int cols=(maxn-maxlen)/(maxlen+2)+1;
    int rows=(n-1)/cols+1;

    printf("cols:%d rows:%d
",cols,rows);

    for(int i=0;i<rows;i++)
    {
        for(int j=0;j<cols;j++)
        {
            int pos=i+j*rows;

            if(pos<n)             /*并没有排满row行col列*/
                print(stv[pos],j==cols-1? maxlen:maxlen+2,' ');
        }
        cout<<endl;
    }

    return 0;
}

5-9 Databa

#include <iostream>
#include <map>
#include <cstring>
#include <cstdio>
#include <string>

using namespace std;

const int maxn=1000;

string Database[maxn][maxn];
map<string,int> st2in;
map<pair<int,int>,int> pama;



int main()
{
    memset(Database,0,sizeof(Database));
    st2in.clear();
    pama.clear();

    int m,n;

    cin>>n;
    cin>>m;

    getchar();                              //注意输入m后'
'留着缓冲区,要先读出来才行

    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            string temp;
            //cin>>temp;
            getline(cin,temp);

            //cout<<temp<<endl;

            Database[i][j]=temp;

            if(!st2in.count(temp))
                st2in[temp]=m*i+j;
        }


    for(int i=0;i<m;i++)
        for(int j=i+1;j<m;j++)
        {
            for(int row=0;row<n;row++)
            {
                string col1=Database[row][i];
                string col2=Database[row][j];

                int pos1=st2in[col1];
                int pos2=st2in[col2];

                if(pama.count(make_pair(pos1,pos2)))
                {
                    cout<<pama[make_pair(pos1,pos2)]<<" "<<i+1<<" ";
                    cout<<row+1<<" "<<i+1<<endl;

                    cout<<pama[make_pair(pos1,pos2)]<<" "<<j+1<<" ";
                    cout<<row+1<<" "<<j+1<<endl;
                }
                else
                {
                    pama[make_pair(pos1,pos2)]=row+1;
                }
            }

            pama.clear();
        }    
}