1061. Dating (20)
来源:互联网 发布:防止软件自动安装 编辑:程序博客网 时间:2024/06/05 19:47
1 #include <stdio.h> 2 #include <map> 3 #include <string.h> 4 #include <ctype.h> 5 using namespace std; 6 int main() 7 { 8 map<char,int> ToHour; 9 int i;10 for(i=0;i<=9;i++)11 ToHour['0'+i]=i;12 for(i='A';i<='N';i++)13 ToHour[i]=i-'A'+10;14 15 char Week[7][4]={ "MON", "TUE", "WED", "THU", "FRI","SAT","SUN"};16 17 char line1[61],line2[61],line3[61],line4[61];18 19 while(gets(line1)!=NULL)20 {21 gets(line2);22 gets(line3);23 gets(line4);24 int fir=1;25 for(i=0;i<(strlen(line1)<strlen(line2)?strlen(line1):strlen(line2));i++)26 {27 if(line1[i]==line2[i]&&line1[i]>='A'&&line1[i]<='G')28 {29 printf("%s",Week[line1[i]-'A']);30 break; 31 }32 }33 34 for(++i;i<(strlen(line1)<strlen(line2)?strlen(line1):strlen(line2));i++)35 {36 if(line1[i]==line2[i]&&((line1[i]>='A'&&line1[i]<='N')||(line1[i]>='0'&&line1[i]<='9')))37 {38 printf(" %02d",ToHour[line1[i]]);39 break; 40 }41 }42 43 for(i=0;i<(strlen(line3)<strlen(line4)?strlen(line3):strlen(line4));i++)44 {45 if(line3[i]==line4[i]&&isalpha(line3[i]))46 {47 printf(":%02d\n",i);48 break;49 }50 }51 }52 53 }
0 0
- 1061. Dating (20)-PAT
- 【PAT】1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- pat 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- pat 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- 1061. Dating (20)
- 1009. Product of Polynomials (25)
- 1027Colors in Mars (20)
- 1035Password (20)
- 1036. Boys vs Girls (25)
- 1058A+B in Hogwarts (20)
- 1061. Dating (20)
- 功能强大的图片截取修剪神器:Android SimpleCropView及其实例代码重用简析
- 用Nodejs连接MySQL
- 题目1444:More is better
- 金融证券交易所
- Linux 下error while loading shared libraries的解決方法
- 最短路径问题
- 最短路
- 电灯小游戏