P1603 斯诺登的密码

https://www.luogu.com.cn/record/20137358

problem/P1603/P1603.cpp

@@ -0,0 +1,118 @@
+// https://www.luogu.com.cn/record/20137358
+
+#include<bits/stdc++.h>
+
+using namespace std;
+
+long long c = 0, word[6] = {0,0,0,0,0,0}, out = 0;
+
+int getst(string s, long long &c) {
+    if(s=="one" || s=="a" || s=="first" || s=="another") {
+        word[c] = 1 ;
+        c++;
+        return 0;
+    }
+    if(s == "two" || s == "both" || s == "second") {
+        word[c] = 4;
+        c++;
+        return 0;
+    }
+    if(s == "three" || s == "third") {
+        word[c]=9;
+        c++;
+        return 0;
+    }
+    if(s == "four") {
+        word[c] = 16;
+        c++;
+        return 0;
+    }
+    if(s == "five") {
+        word[c] = 25;
+        c++;
+        return 0;
+    }
+    if(s == "six") {
+        word[c] = 36;
+        c++;
+        return 0;
+    }
+    if(s == "seven") {
+        word[c] = 49;
+        c++;
+        return 0;
+    }
+    if(s == "eight") {
+        word[c] = 64;
+        c++;
+        return 0;
+    }
+    if(s == "nine") {
+        word[c] = 81;
+        c++;
+        return 0;
+        }
+    if(s == "eleven") {
+        word[c] = 21;
+        c++;
+        return 0;
+    }
+    if(s == "twelve") {
+        word[c] = 44;
+        c++;
+        return 0;
+    }
+    if(s == "thirteen") {
+        word[c] = 69;
+        c++;
+        return 0;
+    }
+    if(s == "fourteen") {
+        word[c] = 96;
+        c++;
+        return 0;
+    }
+    if(s == "fifteen") {
+        word[c] = 25;
+        c++;
+        return 0;
+    }
+    if(s == "sixteen") {
+        word[c] = 56;
+        c++;
+        return 0;
+    }
+    if(s == "seventeen") {
+        word[c] = 89;
+        c++;
+        return 0;
+    }
+    if(s == "eightteen") {
+        word[c] = 24;
+        c++;
+        return 0;
+    }
+    if(s == "nineteen") {
+        word[c] = 61;
+        c++;
+        return 0;
+    }
+}
+
+int main(void) {
+    string getit[6];
+    for (int i = 0 ; i < 6 ; i++) {
+        cin >> getit[i];
+        if (getit[i][getit[i].size()-1] == '.') {
+            getit[i].erase(getit[i].size()-1,1);
+        }
+        getst(getit[i] , c);
+    }
+    sort(word , word + c);
+    for(int i = 0 ; i < c ; i++) {
+        out += word[i];
+        out *= 100;
+    }
+    cout << (out / 100);
+    return 0;
+}