Codeforces Round #404 (Div. 2) A. Anton and Polyhedrons

map水题

题目链接：http://codeforces.com/contest/785/problem/A

#include <iostream>
#include<cstring>
#include<algorithm>
#include<map>
typedef long long ll;
using namespace std;

map<string,int> q;
int main()
{
int n;
cin>>n;
q["Tetrahedron"]=4;
q["Cube"]=6;
q["Octahedron"]=8;
q["Dodecahedron"]=12;
q["Icosahedron"]=20;
ll sum=0;
for(int i=0;i<n;i++)
{
string b;
cin>>b;
sum+=q[b];
}
cout<<sum<<endl;
return 0;
}