P1603 斯诺登的密码

1.字符串对应数字直接用map<string,int>q打表

2.需要排序直接用sort函数

3.注意输入与输出要求特判

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<string, int>q;
int a[26];
int top;
int main() {
	string s;
	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;
	for (int i = 0; i <= 6; i++) {
		cin >> s;
		if (q[s]) {
			int k = q[s] * q[s] % 100;
			a[++top] = k;
		}
	}
	sort(a + 1, a + top + 1);
	cout << a[1];
	for (int i = 2; i <= top; i++) {
		if (a[i] < 10)cout << 0;
		cout << a[i];
	}
	return 0;
}