【Codeforces Round #404 (Div. 2)】题解

A. Anton and Polyhedrons

直接统计+答案就可以了。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 1000
#define LL long long
using namespace std;

char s[10000];

int main()
{
    int n;
    LL sum=0;
    scanf("%d",&n);
    while (n--) {
        scanf("%s",s);
        if (s[0]=='T') sum+=4;
        if (s[0]=='C') sum+=6;
        if (s[0]=='O') sum+=8;
        if (s[0]=='D') sum+=12;
        if (s[0]=='I') sum+=20;
    }
    printf("%I64d\n",sum);
    return 0;
}

View Code