题解 | #后缀子串排序#

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string ss[1100];

int main(void)
{
	string s;
	cin >> s;
	int index = 0;
	for(int i = 0;i < s.size();i++)
	{
		ss[index++] = s.substr(i, s.size() - i);
	}
	sort(ss,ss+index);
	for(int i = 0;i < index;i++) cout << ss[i] << endl;
	
	
	return 0;
}