hdu 1.2.7

最新推荐文章于 2018-03-10 10:03:31 发布

原创最新推荐文章于 2018-03-10 10:03:31 发布 · 449 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

8 篇文章

订阅专栏

简单的字符串匹配问题。

#include<iostream>
#include<cstring>
using namespace std;

int main()
{
int n,i,m,yy,mm,dd;
char str[50];
while(cin>>n)
{
  getchar();
  while(n--)
  {
   cin>>str;
   m=(str[0]-'0')*10+(str[1]-'0');
   yy=(str[6]-'0')*1000+(str[7]-'0')*100+(str[8]-'0')*10+(str[9]-'0');
   mm=(str[10]-'0')*10+(str[11]-'0');
   dd=(str[12]-'0')*10+(str[13]-'0');
   if(m==33)
   {
cout<<"He/She is from Zhejiang,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==11)
   {
cout<<"He/She is from Beijing,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==71)
   {
cout<<"He/She is from Taiwan,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==81)
   {
cout<<"He/She is from Hong Kong,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==82)
   {
cout<<"He/She is from Macao,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==54)
   {
cout<<"He/She is from Tibet,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==21)
   {
cout<<"He/She is from Liaoning,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
   else if(m==31)
   {
cout<<"He/She is from Shanghai,and his/her birthday is on "<<str[10]<<str[11]<<","<<str[12]<<str[13]<<","<<str[6]<<str[7]<<str[8]<<str[9]<<" based on the table."<<endl;
   }
  }
}
return 0;
}