输入一个正整数repeat (0<repeat<10),做repeat次下列运算:
定义一个指针数组将下面的星期信息组织起来,输入一个字符串,在表中查找,若存在,输出该字符串在表中的序号,否则输出-1。
Sunday Monday Tuesday Wednesday Thursday Friday Saturday
输入输出示例:括号内为说明,无需输入输出
样例-repeat3-">输入样例 (repeat=3) :
3
Tuesday
Wednesday
year
输出样例:
3
4
-1
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s1[n];
string s2[7]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
string *p=s2;
for(int i=0;i<n;i++)
{
cin>>s1[i];
}
for(int i=0;i<n;i++)
{
int sum=0;
for(int j=0;j<7;j++)
{
if(*(p+j)==s1[i])
{
cout<<j+1<<endl;
sum+=1;
}
}
if(sum==0)
{
cout<<"-1"<<endl;
}
}
return 0;
}