-
Notifications
You must be signed in to change notification settings - Fork 0
/
AntonAndPolyhedrons.cc
47 lines (44 loc) · 1.07 KB
/
AntonAndPolyhedrons.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(cont) cont.begin(), cont.end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define fore(i, a, b) for (int i = a, almo5t = b; i < almo5t; ++i)
#define SZ(x) ((int)x.size())
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define FIN \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef long long int ll;
using namespace std;
int main()
{
FIN;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int count = 0;
map<string, int> m;
m.insert({"Tetrahedron", 4});
m.insert({"Cube", 6});
m.insert({"Octahedron", 8});
m.insert({"Dodecahedron", 12});
m.insert({"Icosahedron", 20});
int ans = 0;
while (n--)
{
string s;
cin >> s;
ans += m[s];
}
cout << ans;
return 0;
}