BNU 51002 BQG's Complexity Analysis

模拟

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn=+;
char t1[maxn],t2[maxn];
int g1,g2,h1,h2;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        g1=g2=h1=h2=;
        scanf("%s%s",t1,t2);

        if(t1[]=='n') g1=;
        if(t1[]=='^')
        {
            g1=;
            for(int i=;;i++)
            {
                if(t1[i]>=''&&t1[i]<='') g1=g1*+t1[i]-'';
                else break;
            }
        }

        int pos=-;
        int len=strlen(t1);
        for(int i=;t1[i];i++)
        {
            if(i+<len&&t1[i]=='l'&&t1[i+]=='o'&&t1[i+]=='g'&&t1[i+]=='n')
            {
                h1=;
                pos=i+;
                break;
            }
        }
        if(pos!=-)
        {
            int sum=;
            for(int i=pos;i<len;i++)
            {
                if(t1[i]>=''&&t1[i]<='') sum=sum*+t1[i]-'';
                else break;
            }
            h1=max(h1,sum);
        }

        if(t2[]=='n') g2=;
        if(t2[]=='^')
        {
            g2=;
            for(int i=;;i++)
            {
                if(t2[i]>=''&&t2[i]<='') g2=g2*+t2[i]-'';
                else break;
            }
        }

         pos=-;
         len=strlen(t2);
        for(int i=;t2[i];i++)
        {
            if(i+<len&&t2[i]=='l'&&t2[i+]=='o'&&t2[i+]=='g'&&t2[i+]=='n')
            {
                h2=;
                pos=i+;
                break;
            }
        }
        if(pos!=-)
        {
            int sum=;
            for(int i=pos;i<len;i++)
            {
                if(t2[i]>=''&&t2[i]<='') sum=sum*+t2[i]-'';
                else break;
            }
            h2=max(h2,sum);
        }

      //  printf("%d %d\n",g1,h1);
      //  printf("%d %d\n",g2,h2);

      if(g1<g2) printf("First\n");
      else if(g1>g2) printf("Second\n");
      else
      {
          if(h1<h2) printf("First\n");
          else if(h1>h2) printf("Second\n");
          else printf("Both\n");
      }

    }
    return ;
}