输入一个正整数repeat (0<repeat<10),做repeat次下列运算:
定义一个指针数组将下面的星期信息组织起来,输入一个字符串,在表中查找,若存在,输出该字符串在表中的序号,否则输出-1。
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
输入输出示例:括号内为说明,无需输入输出
输入样例 (repeat=3) :
3
Tuesday
Wednesday
year
结尾无空行
输出样例:
3
4
-1
结尾无空行
代码如下:#include<iostream>
#include<string>
using namespace std;
int main()
{
int repeat;
cin >> repeat;
string s[10];
const char* week[7] = { "Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday" };
for (int i = 0; i < repeat; i++)
{
cin >> s[i];
if (s[i] == "Sunday") { cout << 1<<'\n'; }
else if (s[i] == "Monday") { cout << 2<<'\n'; }
else if (s[i] == "Tuesday") { cout << 3<<'\n'; }
else if (s[i] == "Wednesday") { cout << 4<<'\n'; }
else if (s[i] == "Thursday") { cout << 5<<'\n'; }
else if (s[i] == "Friday") { cout << 6<<'\n'; }
else if (s[i] == "Saturday") { cout << 7<<'\n'; }
else { cout << -1<<'\n'; }
}
}