打卡信奥刷题（013）用C++信奥P9300[普及组/提高] [CCC 2023 J2] Chili Peppers

Loge信奥

于 2024-10-08 11:00:15 发布

阅读量323

点赞数 17

分类专栏： C++ 文章标签： c++ 开发语言算法青少年编程数据结构

本文链接：https://blog.csdn.net/rogeliu/article/details/142735972

版权

C++ 专栏收录该内容

15 篇文章 1 订阅

订阅专栏

[CCC 2023 J2] Chili Peppers

题面翻译

Ron 在尝试使用一些辣椒做一份黑暗料理，每一个辣椒都有其自己特别的辣度，如下表：

辣椒名	辣度
Poblano	$1500$
Mirasol	$6000$
Serrano	$15500$
Cayenne	$40000$
Thai	$75000$
Habanero	$125000$

一份黑暗料理的辣度是根据所有辣椒辣度的总和决定的。

现在请你实现一个程序，输入的第一行为 $n$ （ $\leq n \leq 10$ ），表示一共放了 $n$ 个辣椒，接下来 $n$ 行，一行一个字符串 $s_i$ ，表示放入辣椒的名称。现在请你求出那份黑暗料理的辣度。

题目描述

Ron is cooking chili using an assortment of peppers.

The spiciness of a pepper is measured in Scolville Heat Units (SHU).Ron’s chili is currently not spicy at all, but each time Ron adds a pepper, the total spiciness of the chili increases by the SHU value of that pepper.
The SHU values of the peppers available to Ron are shown in the following table:

Pepper Name	Scolville Heat Units
Poblano	$1500$
Mirasol	$6000$
Serrano	$15500$
Cayenne	$40000$
Thai	$75000$
Habanero	$125000$

Your job is to determine the total spiciness of Ron’s chili after he has finished adding peppers.

输入格式

The first line of input will contain a positive integer $N$ , representing the number of peppers Ron adds to his chili. The next $N$ lines will each contain the name of a pepper Ron has added. Each pepper name will exactly match a name that appears in the table above. Note that more than one pepper of the same name can be added.

输出格式

The output will consist of a positive integer $T$ , representing the total spiciness of Ron’s chili.

样例 #1

样例输入 #1

4
Poblano
Cayenne
Thai
Poblano

样例输出 #1

C++实现

#include

using namespace std;
int n;

int main(){
cin>>n;
int ans = 0;
for(int i=1;i<=n;i++){
string s;
cin>>s;
if(s[0]‘P’)
ans+=1500;
else if(s[0]‘M’)
ans+=6000;
else if(s[0]‘S’)
ans+=15500;
else if(s[0]‘C’)
ans+=40000;
else if(s[0]==‘T’)
ans+=75000;
else
ans+=125000;
}
cout<< ans;
return 0;
}
在这里插入图片描述