Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- #include <sstream>
- #include <ctime>
- #include <set>
- #include <map>
- #include <string>
- #include <stack>
- #include <fstream>
- #include <ctime>
- using namespace std;
- int main()
- {
- int n;
- cin >> n;
- vector<vector<string> > v;
- for(int i = 0; i < n; ++i)
- {
- string s;
- cin >> s;
- string curS;
- v.push_back(vector<string>());
- for(int j = 0; j < s.size(); ++j)
- {
- if (s[j] == '\\')
- {
- v.back().push_back(curS);
- curS = "";
- }
- else
- curS += s[j];
- }
- v.back().push_back(curS);
- }
- sort(v.begin(), v.end());
- for(int i = 0; i < n; ++i)
- {
- if (i == 0)
- for(int j = 0; j < v[i].size(); ++j)
- cout << string(j, ' ') << v[i][j] << endl;
- else
- {
- int k = 0;
- while(k < v[i-1].size() && k < v[i].size() && v[i-1][k] == v[i][k])
- ++k;
- for(int t = k; t < v[i].size(); ++t)
- cout << string(t, ' ') << v[i][t] << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement