个人感觉你的代码查找还是有点慢，你可以看看我的，也是通过打表做的。~~蒟蒻~~不敢说话
```cpp #include<iostream>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
int arr[100];
int main()
{
map<string,int> q;
q["one"]=1;
q["two"]=2;
q["three"]=3;
q["four"]=4;
q["five"]=5;
q["six"]=6;
q["seven"]=7;
q["eight"]=8;
q["nine"]=9;
q["ten"]=10;
q["eleven"]=11;
q["twelve"]=12;
q["thirteen"]=13;
q["fourteen"]=14;
q["fifteen"]=15;
q["sixteen"]=16;
q["seventeen"]=17;
q["eighteen"]=18;
q["nineteen"]=19;
q["twenty"]=20;
q["a"]=1;
q["both"]=2;
q["another"]=1;
q["first"]=1;
q["second"]=2;
q["third"]=3;
int flag = 0;
string str;
while(cin >> str)
{
if(q[str])
{
if(q[str]*q[str]%100 != 0)
{
arr[flag++] = (q[str]*q[str])%100;
}
}
}
if(flag)
{
sort(arr,arr+flag-1);
cout << arr[0];
for(int i = 1;i < flag;i++)
{
if(arr[i] >= 10)
cout << arr[i];
else
cout << 0 << arr[i];
}
}
else
cout << 0;
return 0;
}
by Smithespics @ 2023-03-09 15:44:05