1155: 字符串比较 多实例

1155: 字符串比较 多实例

时间限制: 1 Sec  内存限制: 128 MB
提交: 1756  解决: 524
[提交][状态][讨论版][命题人:admin]

题目描述

比较字符串大小，但比较的规则不同字典序规则。字符比较新规则如下：A < a < B < b < ………… < Z < z。

输入

输入数据包含多个测试实例，每个测试实例占两行，每一行有一个字符串（只包含大小写字母， 长度小于10000）。

输出

如果第一个字符串小于第二个，输出YES，否则，输出NO。 
注意：A < a < B < b < ………… < Z < z。

样例输入

abc
Bbc
Ab
a
ABcef
ABce

样例输出

YES
YES
NO

提示

来源

 #include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char ch1[10000],ch2[10000];
int i;
while(scanf("%s%s",ch1,ch2)!=EOF)
{
for(i=0; ch1[i]!='\0'; i++)
{
if(ch1[i]=='a')
ch1[i]=2;
else if(ch1[i]=='b')
ch1[i]=4;
else if(ch1[i]=='c')
ch1[i]=6;
else if(ch1[i]=='d')
ch1[i]=8;
else if(ch1[i]=='e')
ch1[i]=10;
else if(ch1[i]=='f')
ch1[i]=12;
else if(ch1[i]=='g')
ch1[i]=14;
else if(ch1[i]=='h')
ch1[i]=16;
else if(ch1[i]=='i')
ch1[i]=18;
else if(ch1[i]=='j')
ch1[i]=20;
else if(ch1[i]=='k')
ch1[i]=22;
else if(ch1[i]=='l')
ch1[i]=24;
else if(ch1[i]=='m')
ch1[i]=26;
else if(ch1[i]=='n')
ch1[i]=28;
else if(ch1[i]=='o')
ch1[i]=30;
else if(ch1[i]=='p')
ch1[i]=32;
else if(ch1[i]=='q')
ch1[i]=34;
else if(ch1[i]=='r')
ch1[i]=36;
else if(ch1[i]=='s')
ch1[i]=38;
else if(ch1[i]=='t')
ch1[i]=40;
else if(ch1[i]=='u')
ch1[i]=42;
else if(ch1[i]=='v')
ch1[i]=44;
else if(ch1[i]=='w')
ch1[i]=46;
else if(ch1[i]=='x')
ch1[i]=48;
else if(ch1[i]=='y')
ch1[i]=50;
else if(ch1[i]=='z')
ch1[i]=52;
else if(ch1[i]=='A')
ch1[i]=1;
else if(ch1[i]=='B')
ch1[i]=3;
else if(ch1[i]=='C')
ch1[i]=5;
else if(ch1[i]=='D')
ch1[i]=7;
else if(ch1[i]=='E')
ch1[i]=9;
else if(ch1[i]=='F')
ch1[i]=11;
else if(ch1[i]=='G')
ch1[i]=13;
else if(ch1[i]=='H')
ch1[i]=15;
else if(ch1[i]=='I')
ch1[i]=17;
else if(ch1[i]=='J')
ch1[i]=19;
else if(ch1[i]=='K')
ch1[i]=21;
else if(ch1[i]=='L')
ch1[i]=23;
else if(ch1[i]=='M')
ch1[i]=25;
else if(ch1[i]=='N')
ch1[i]=27;
else if(ch1[i]=='O')
ch1[i]=29;
else if(ch1[i]=='P')
ch1[i]=31;
else if(ch1[i]=='Q')
ch1[i]=33;
else if(ch1[i]=='R')
ch1[i]=35;
else if(ch1[i]=='S')
ch1[i]=37;
else if(ch1[i]=='T')
ch1[i]=39;
else if(ch1[i]=='U')
ch1[i]=41;
else if(ch1[i]=='V')
ch1[i]=43;
else if(ch1[i]=='W')
ch1[i]=45;
else if(ch1[i]=='X')
ch1[i]=47;
else if(ch1[i]=='Y')
ch1[i]=49;
else if(ch1[i]=='Z')
ch1[i]=51;
}
for(i=0; ch2[i]!='\0'; i++)
{
if(ch2[i]=='a')
ch2[i]=2;
el
4000
se if(ch2[i]=='b')
ch2[i]=4;
else if(ch2[i]=='c')
ch2[i]=6;
else if(ch2[i]=='d')
ch2[i]=8;
else if(ch2[i]=='e')
ch2[i]=10;
else if(ch2[i]=='f')
ch2[i]=12;
else if(ch2[i]=='g')
ch2[i]=14;
else if(ch2[i]=='h')
ch2[i]=16;
else if(ch2[i]=='i')
ch2[i]=18;
else if(ch2[i]=='j')
ch2[i]=20;
else if(ch2[i]=='k')
ch2[i]=22;
else if(ch2[i]=='l')
ch2[i]=24;
else if(ch2[i]=='m')
ch2[i]=26;
else if(ch2[i]=='n')
ch2[i]=28;
else if(ch2[i]=='o')
ch2[i]=30;
else if(ch2[i]=='p')
ch2[i]=32;
else if(ch2[i]=='q')
ch2[i]=34;
else if(ch2[i]=='r')
ch2[i]=36;
else if(ch2[i]=='s')
ch2[i]=38;
else if(ch2[i]=='t')
ch2[i]=40;
else if(ch2[i]=='u')
ch2[i]=42;
else if(ch2[i]=='v')
ch2[i]=44;
else if(ch2[i]=='w')
ch2[i]=46;
else if(ch2[i]=='x')
ch2[i]=48;
else if(ch2[i]=='y')
ch2[i]=50;
else if(ch2[i]=='z')
ch2[i]=52;
else if(ch2[i]=='A')
ch2[i]=1;
else if(ch2[i]=='B')
ch2[i]=3;
else if(ch2[i]=='C')
ch2[i]=5;
else if(ch2[i]=='D')
ch2[i]=7;
else if(ch2[i]=='E')
ch2[i]=9;
else if(ch2[i]=='F')
ch2[i]=11;
else if(ch2[i]=='G')
ch2[i]=13;
else if(ch2[i]=='H')
ch2[i]=15;
else if(ch2[i]=='I')
ch2[i]=17;
else if(ch2[i]=='J')
ch2[i]=19;
else if(ch2[i]=='K')
ch2[i]=21;
else if(ch2[i]=='L')
ch2[i]=23;
else if(ch2[i]=='M')
ch2[i]=25;
else if(ch2[i]=='N')
ch2[i]=27;
else if(ch2[i]=='O')
ch2[i]=29;
else if(ch2[i]=='P')
ch2[i]=31;
else if(ch2[i]=='Q')
ch2[i]=33;
else if(ch2[i]=='R')
ch2[i]=35;
else if(ch2[i]=='S')
ch2[i]=37;
else if(ch2[i]=='T')
ch2[i]=39;
else if(ch2[i]=='U')
ch2[i]=41;
else if(ch2[i]=='V')
ch2[i]=43;
else if(ch2[i]=='W')
ch2[i]=45;
else if(ch2[i]=='X')
ch2[i]=47;
else if(ch2[i]=='Y')
ch2[i]=49;
else if(ch2[i]=='Z')
ch2[i]=51;
}
if(strcmp(ch1,ch2)<0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}