zoukankan      html  css  js  c++  java
  • PAT Basic Level 1014

    AC代码

      1 #include <stdio.h>
      2 #include <string.h>
      3 int main ()
      4 {
      5     char string1[61];
      6     char string2[61];
      7     char string3[61];
      8     char string4[61];
      9     scanf("%s",&string1);
     10     scanf("%s",&string2);
     11     scanf("%s",&string3);
     12     scanf("%s",&string4);
     13     int length1 = strlen(string1);
     14     int length2 = strlen(string2);
     15     int length3 = strlen(string3);
     16     int length4 = strlen(string4);
     17     int p1 = 0;//指向长的
     18     int p2 = 0; 
     19     char day;
     20     char hour;
     21     char minute;
     22     int flag = 0;//记录第几次相同 
     23     if(length1 > length2)
     24     {
     25         for(p1 = 0;p1 < length1&&p1<length2;p1++)
     26         {
     27             
     28             
     29                 if(string1[p1] == string2[p1])
     30                 {
     31                     
     32                     if(flag == 0&&(string1[p1] >= 'A'&&string1[p1] <= 'G'))
     33                     {
     34                         flag++;
     35                         day = string1[p1];
     36                     }
     37                     else
     38                     if(flag == 1&&(string1[p1] >= '0'&&string1[p1] <= 'N'))
     39                     {
     40                         flag++;
     41                         hour = string1[p1];
     42                     }
     43                 }
     44             
     45         } 
     46     }
     47     else
     48     {
     49         for(p2 = 0;p2 < length2&&p2 < length1;p2++)
     50         {
     51             
     52             
     53                 if(string2[p2] == string1[p2])
     54                 {
     55                 
     56                     if(flag == 0&&(string1[p2] >= 'A'&&string1[p2] <= 'G'))
     57                     {
     58                             flag++;
     59                         day = string2[p2];
     60                     }else
     61                     if(flag == 1&&(string1[p2] >= '0'&&string1[p2] <= 'N'))
     62                     {
     63                             flag++;
     64                         hour = string2[p2];
     65                     }
     66                 }
     67             
     68         } 
     69     }
     70     switch(day)
     71     {
     72         case 'A':printf("MON ");
     73         break;
     74         case 'B':printf("TUE ");
     75         break;
     76         case 'C':printf("WED ");
     77         break;
     78         case 'D':printf("THU ");
     79         break;
     80         case 'E':printf("FRI ");
     81         break;
     82         case 'F':printf("SAT ");
     83         break;
     84         case 'G':printf("SUN ");
     85         break;
     86     }
     87     switch(hour)
     88     {
     89         case '0':printf("00:");
     90         break;
     91         case '1':printf("01:");
     92         break;
     93         case '2':printf("02:");
     94         break;
     95         case '3':printf("03:");
     96         break;
     97         case '4':printf("04:");
     98         break;
     99         case '5':printf("05:");
    100         break;
    101         case '6':printf("06:");
    102         break;
    103         case '7':printf("07:");
    104         break;
    105         case '8':printf("08:");
    106         break;
    107         case '9':printf("09:");
    108         break;
    109         case 'A':printf("10:");
    110         break;
    111         case 'B':printf("11:");
    112         break;
    113         case 'C':printf("12:");
    114         break;
    115         case 'D':printf("13:");
    116         break;
    117         case 'E':printf("14:");
    118         break;
    119         case 'F':printf("15:");
    120         break;
    121         case 'G':printf("16:");
    122         break;
    123         case 'H':printf("17:");
    124         break;
    125         case 'I':printf("18:");
    126         break;
    127         case 'J':printf("19:");
    128         break;
    129         case 'K':printf("20:");
    130         break;
    131         case 'L':printf("21:");
    132         break;
    133         case 'M':printf("22:");
    134         break;
    135         case 'N':printf("23:");
    136         break;
    137     }
    138     int cnt = 0;
    139     int exit = 0;
    140     if(length3 > length4)
    141     {
    142         for(p1 = 0;p1 < length3&&p1 < length4;p1++)
    143         {
    144             cnt++;
    145             
    146             
    147                 if(string3[p1] == string4[p2])
    148                 {
    149                     exit = 1;
    150                     break;
    151                 }
    152             
    153             
    154             if(exit == 1)
    155             break;
    156         }
    157     }
    158     else
    159     {
    160         for(p2 = 0;p2 < length4&&p2 < length3;p2++)
    161         {
    162             
    163             
    164             
    165                 if(string4[p2] == string3[p2]&&((string4[p2]>='a'&&string4[p2]<='z')||string4[p2]>='A'&&string4[p2]<='Z'))
    166                 {
    167                     exit = 1;
    168                     break;
    169                 }
    170             
    171         
    172             if(exit == 1)
    173             break;
    174             cnt++;
    175         }
    176     }
    177     if(cnt<10)
    178     {
    179         printf("0");
    180         printf("%d",cnt);
    181     }
    182     else {
    183         printf("%d",cnt);
    184     }
    185     return 0;
    186     
    187  } 
  • 相关阅读:
    前端内容转译html
    检查数据接口返回数据合法性
    接口数据一致性校验工具
    白盒测试——私有接口测试
    服务端用例设计的思(tao)路!
    服务端的性能测试(一)
    Android移动网络如何抓取数据包
    使用loadrunner进行压力测试遇到的问题总结
    我的天呐,小明竟然被程序猿哥哥追着打
    python处理文本文件
  • 原文地址:https://www.cnblogs.com/Ponytai1/p/5976477.html
Copyright © 2011-2022 走看看