Gym

来源：互联网发布：湖北襄阳农村淘宝招募编辑：程序博客网时间：2024/05/22 17:28
手动打表
#include<iostream>#include<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<set>#include<queue>#include<stack>#include<map>#define PI acos(-1.0)#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)using namespace std;typedef long long ll;typedef unsigned long long ull;const int maxn = 1000 + 7, maxd = (1<<18)-1, mod = 1e9 + 7;const int INF = 0x7f7f7f7f;char a[30] = {2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 };char b[30] = {0, 1, 0, 1, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0 };int main() {char s[maxn];    while(~scanf("%s", s)) {        int n = strlen(s);        int ans1 = 0, ans2 = 0;        for(int i = 0; i < n; ++i) {            if(s[i] >= 'A' && s[i] <= 'Z') {                ans1 += (a[s[i]-'A']);                ans2 += (b[s[i]-'A']);            }            else {                ans1 += (a[s[i]-'a']);                ans2 += (b[s[i]-'a']);            }        }        if(ans1 > ans2) {            puts("Kangaroos");        }        else if(ans1 == ans2) {            puts("Feud continues");        }        else puts("Kiwis");    }    return 0;}