北京师范大学校赛C

https://www.nowcoder.com/acm/contest/submit/0dff89ad7b8444719df155d507f3e1dd?ACMContestId=3&tagId=4

解析 字符比较 水

AC代码

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
using namespace std;
const int maxn= 100005;
const int inf = 0x3f3f3f3f;
typedef long long ll;
char a[5][10]={"zero","two","four","six","nine"};
char b[5]={'0','2','4','6','9'};
char s[maxn];
char k[maxn];
int main(int argc, char const *argv[])
{
  int t;
  cin>>t;
  while(t--)
  {
    scanf("%s",s);
    int len=strlen(s);
    int t=0;
    for(int i=0;i<len;)
    {
      if(s[i]=='0'||s[i]=='2'||s[i]=='4'||s[i]=='6'||s[i]=='9')
      {
        k[t++]=s[i];
        i++;
      }
      else if(s[i]=='1'||s[i]=='3'||s[i]=='5'||s[i]=='7'||s[i]=='8')
        i++;
      else
      {
        int flag1=0;
        for(int j=0;j<5;j++)
        {
          int flag2=0,n=i;
          int lenj=strlen(a[j]);
          for(int l=0;l<lenj;l++)
          {
            if(s[n]==a[j][l])
            {
              n++;
              flag2++;
            }
            else
              break;
          }
          if(flag2==lenj)
          {
            k[t++]=b[j];
            flag1=1;
            i=n;
            break;
          }
        }
        if(flag1==0)
          i++;
      }
    }
    for(int i=0;i<t;i++)
      cout<<k[i];
    cout<<endl;
  }
}