codeforces round#404(div.2) A. Anton and Polyhedrons

题意：有若干立体图形，每个有固定的边数，计算输入图形的总边数。

水题，暴力求解即可。

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>#include<cmath>#include<set>#include<bitset>#include<map>#include<stack>#include<queue>#include<vector>#include<utility>#define INF 0x3f3f3f3f#define inf 2*0x3f3f3f3f#define llinf 1000000000000000000#define pi acos(-1)#define mod 1000000007using namespace std;typedef long long ll;typedef pair<int,int>P;map<string,int>m;int n,sum=0;string s;int main(){    m["Tetrahedron"]=4;m["Cube"]=6;m["Octahedron"]=8;    m["Dodecahedron"]=12;m["Icosahedron"]=20;    cin>>n;    for(int i=0;i<n;i++)    {        cin>>s;sum+=m[s];    }    cout<<sum;    return 0;}