模拟 HDOJ 5099 Comparison of Android versions

题目传送门

 /*
     题意：比较型号的大小
     模拟：坑点在长度可能为5，此时设为'A'
 */
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 #include <ctime>
 #include <cstdlib>
 using namespace std;

 const int MAXN = 1e4 + ;
 const int INF = 0x3f3f3f3f;
 char s1[], s2[];

 char check(void)
 {
     for (int i=; i<=; ++i)
     {
         if (s1[i] < s2[i])    return '<';
         else if (s1[i] > s2[i])    return '>';
     }

     if (s1[] == s2[])
     {
         if (s1[] == '\0')    s1[] = 'A';
         if (s2[] == '\0')    s2[] = 'A';
         if (s1[] < s2[])    return '<';
         else if (s1[] > s2[])    return '>';
     }

     return '=';
 }

 int main(void)        //HDOJ 5099    Comparison of Android versions
 {
     //freopen ("J.in", "r", stdin);

     int t, cas = ;    scanf ("%d", &t);
     while (t--)
     {
         scanf ("%s%s", s1, s2);
         char ch1 = (s1[] == s2[]) ? '=' : (s1[] < s2[]) ? '<' : '>';
         char ch2 = check ();
         printf ("Case %d: %c %c\n", ++cas, ch1, ch2);
     }

     return ;
 }

 /*
 Case 1: > >
 Case 2: = <
 */