B. File List
生活随笔
收集整理的這篇文章主要介紹了
B. File List
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
174B. File List:題目
可惡啊,寫了一堆bug,最討厭字符串處理了(〃>目<) #include <bits/stdc++.h> using namespace std; // #define int long long string s, ss = ""; vector<string> ve; signed main() {// freopen("input.txt","r",stdin);// freopen("output.txt","w",stdout);cin >> s;int n = s.length();int ff = 1;for (int i = 0; i < n; i++){if (s[i] == '.'){if (ss == ""){ff = 0;break;}ve.push_back(ss), ss = "";}elsess += s[i];}// cout<<ff<<endl;if (ss == "")ff = 0;ve.push_back(ss);int m = ve.size();// cout<<ff<<endl;if (m == 1)ff = 0;// cout<<ff<<endl;if (ve[0].size()>8) ff = 0;for (int i = 1; i < m - 1; i++){int cou = ve[i].size();// cout<<cou<<endl;if (cou == 1 || cou > 11)ff = 0;}// cout<<ff<<endl;if (ve[m - 1].size() > 3)ff = 0;// cout<<ff<<endl;int cnt = 0;if (ff){cout << "YES" << endl;for (int i = 0; i < m - 1; i++){for (int j = cnt; j < ve[i].size(); j++)cout << ve[i][j];cout << ".";if (i != m - 2){int cou = max(1, (int)ve[i + 1].size() - 8);cnt = cou;if (i != m - 2)for (int j = 0; j < cou; j++)cout << ve[i + 1][j];if (i != m - 2)cout << endl;}}cnt = 0;for (int j = cnt; j < ve[m - 1].size(); j++)cout << ve[m - 1][j];cout << endl;}elsecout << "NO" << endl;return 0; }總結
以上是生活随笔為你收集整理的B. File List的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: http --- HTTPS是在安全的
- 下一篇: ER图(实体关系图)怎么画?