题意:给你n个字符,他们之间按照以下优先级排序:
数字比字母小,两个字母间按照ascii码比较,两个十进制数字则按照大小排序。
给你n个字符串,问每一个比第一个优先级如何。
思路:这场比赛唯一比较简单的题了,就是按照要求进行模拟就行,因为串长最大为9,不用太复杂,代码有点丑。
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 10;
const int inf = 0x3f3f3f3f;
string s;
int main()
{
int n;
cin >> n;
cin >> s;
int len = s.length();
string s1;
for(int l = 0; l < n; ++l)
{
cin >> s1;
int len1 = s1.length();
bool flag = false;
int i = 0, j = 0;
if(s == s1)
flag = true;
while(i < len && j < len1)
{
if(s[i] != s1[j] || (s[i] == s1[j] && s[i] <= '9' && s[i] >= '0'))
{
if(s[i] >= 'a' && s[i] <= 'z' || s[i] >= 'A' && s[i] <= 'Z')
{
if(s1[i] > s[i])
{
flag = true;
}
break;
}
else if(s[i] >= '0' && s[i] <= '9')
{
if(s1[i] >= '0' && s1[i] <= '9')
{
int a = 0, b = 0;
for(; i < len; ++i)
{
if(s[i] >= '0' && s[i] <= '9')
a = a * 10 + s[i] - '0';
else
break;
}
for(; j < len1; ++j)
{
if(s1[j] >= '0' && s1[j] <= '9')
b = b * 10 + s1[j] - '0';
else
break;
}
--i, --j;
if(a < b)
{
flag = true;
break;
}
else if(a > b)
break;
}
else
flag = true;
}
//break;
}
if(i == len - 1 && j < len1)
flag = true;
++i, ++j;
}
if(flag)
cout << "+" << endl;
else
cout << "-" << endl;
}
return 0;
}