芹菜本菜 • 20小时前
using namespace std; string mi[10001], ma[10001];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
mi[i] = s;
ma[i] = s;
sort(mi[i].begin(), mi[i].end());
sort(ma[i].rbegin(), ma[i].rend());
}
for (int i = 1; i <= n; i++) {
bool flag = 1;
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
if (!(mi[i] < ma[j]))
flag = 0;
}
cout << flag;
}
return 0;
}
评论:
请先登录,才能进行评论