【codeforces 785A】Anton and Polyhedrons
2017-10-04 18:45
375 查看
【题目链接】: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; }
相关文章推荐
- CodeForces 785A Anton and Polyhedrons
- 【25.00%】【codeforces 584E】Anton and Ira
- codeforces 785 E. Anton and Permutation
- codeforces - 734A&B - Anton and Danik/Digit(水)
- CodeForces 734 A.Anton and Danik(水~)
- codeforces 785 D Anton and School - 2(组合数学)
- Codeforces-785E-Anton and Permutation(分块区间查询,动态查询[l,r]内小于某个值的元素个数)
- Codeforces-734A-Anton and Danik(很水)
- Codeforces 443A Anton and Letters(水题)
- 【codeforces 785C】Anton and Fairy Tale
- CodeForces 443A Anton and Letters
- Codeforces 785E Anton and Permutation(分块)
- CodeForces 785E Anton and Permutation 分块
- codeforces - 734E - Anton and Tree(图论 树)
- Codeforces-734B-Anton and Digits(贪心)
- CodeForces 734E - Anton and Tree
- 【codeforces 785D】Anton and School - 2
- 【codeforces 785B】Anton and Classes
- CodeForces 734 B.Anton and Digits(水~)
- 【Codeforces 734 D Anton and Chess】