【codeforces 785A】Anton and Polyhedrons

【题目链接】:http://codeforces.com/contest/785

【题意】

给你各种形状的物体;
然后让你计算总的面数;

【题解】

用map来记录各种物体本该有的面数;
读入各种物体;
然后累加各种物体的面数;
然后输出就好;

【完整代码】

#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%lld",&x)
#define ref(x) scanf("%lf",&x)

typedef pair<int, int> pii;
typedef pair<LL, LL> pll;

const int dx[9] = { 0,1,-1,0,0,-1,-1,1,1 };
const int dy[9] = { 0,0,0,-1,1,-1,1,-1,1 };
const double pi = acos(-1.0);
const int N = 110;

string s;
map <string, int> dic;
int n;

void input_data()
{
    dic["Tetrahedron"] = 4;
    dic["Cube"] = 6;
    dic["Octahedron"] = 8;
    dic["Dodecahedron"] = 12;
    dic["Icosahedron"] = 20;
    rei(n);
}

void o()
{
    int ans = 0;
    rep1(i, 1, n)
    {
        cin >> s;
        ans += dic[s];
    }
    printf("%d\n", ans);
}

int main()
{
    //freopen("F:\\rush.txt", "r", stdin);
    input_data();
    o();
    //printf("\n%.2lf sec \n", (double)clock() / CLOCKS_PER_SEC);
    return 0;
}