poj2895

简单题

View Code

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;

#define maxl 1005

int p, w;
char st[maxl];
int f[30] =
{ 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9 };
int g[30] =
{ 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4 };
int value[500];
int id[500];

void input()
{
    scanf("%d%d", &p, &w);
    getchar();
    gets(st);
}

void work()
{
int len = strlen(st);
long long ans = 0;
for (int i = 0; i < len; i++)
        ans += value[st[i]] * p;
for (int i = 0; i < len - 1; i++)
if (id[st[i]] == id[st[i + 1]] && st[i] != ' ')
            ans += w;
    printf("%lld\n", ans);
}

int main()
{
//freopen("t.txt", "r", stdin);
    for (int i = 0; i < 26; i++)
    {
        id[i + 'A'] = f[i];
        value[i + 'A'] = g[i];
    }
    id[' '] = 1;
    value[' '] = 1;
int t;
    scanf("%d", &t);
while (t--)
    {
        input();
        work();
    }
return 0;
}