zoukankan      html  css  js  c++  java
  • 爬格子呀5-1

    人生第一次c++,感觉很舒服~~
    代码如下:

    #include<iostream>
    #include<cstring>
    #include<sstream>
    #include<algorithm>
    #include<vector>
    using namespace std;
    
    const int MAX = 1000;
    
    int main() {
        int i = 0, j = 0, num[MAX];
        string line;
        vector<string>serie[MAX];
        while (getline(cin, line)) {
            char tmp;
            stringstream ss(line);
            while (ss >> tmp) {
                if (tmp == ' ') {
                    num[i]++;
                }
            }
            serie[j++].push_back(line);
            i++;
        }
        sort(num, num + i);
        i = num[0];
        vector<string>::iterator it = serie[j].begin();
        advance(it, i);
        while (j-- > 0) {
            serie[j].erase(serie[j].begin(), it);
            for (auto&& k : serie[j])
                cout << k << "
    " << endl;
        }
        /*for (vector<string>::iterator itt = serie[j].begin(); itt < serie->end(); itt++) {
            cout << *itt << "
    " << endl;
        }*/
        return 0;
    }
    
    
    
    
    
    
    
  • 相关阅读:
    van Emda Boas
    斐波那契堆
    NTT
    FFT
    KDTree
    扩展kmp
    kmp
    Dancing Links
    树的prufer编码
    有向图最小路径覆盖
  • 原文地址:https://www.cnblogs.com/romaLzhih/p/9489865.html
Copyright © 2011-2022 走看看