水仙题-hdu2054

A == B ? Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 77824    Accepted Submission(s): 12370 Problem Description Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".   Input each test case contains two numbers A and B.   Output for each case, if A is equal to B, you should print "YES", or print "NO".   Sample Input 1 2 2 2 3 3 4 3   Sample Output NO YES YES NO 水题中的偏上题 小数点后加0判断即可； #include<stdio.h> #include<string.h> #include<cmath> #include<algorithm> using namespace std; int main(){ char a[100010],b[100010]; while(~scanf("%s%s",a,b)){ int len1 = strlen(a); int len2 = strlen(b); int i,flag1 = 0,flag2 = 0; for(i = 0;i<len1;i++)if(a[i] == '.'){flag1 =1;break;} for(i = 0;i<len2;i++)if(b[i] == '.'){flag2 =1;break;} if(flag1==0){a[len1] = '.';len1++;flag1=1;} if(flag2==0){b[len2] = '.';len2++;flag2=1;} if(flag1&&len1<len2){for(i = len1;i<len2;i++)a[i] = '0';len1=len2;} else if(flag2&&len2<len1){for(i = len2;i<len1;i++)b[i] = '0';len2=len1;} if(len1!=len2)puts("NO"); else{ for(i = 0;i<len1;i++){ if(a[i]!=b[i])break; } if(i == len1)puts("YES"); else puts("NO"); } } }