HDU--2054 -- A == B ? [字符串]

来源：互联网发布：2007版数据透视表教程编辑：程序博客网时间：2024/06/06 01:20

A == B ?

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 51266 Accepted Submission(s): 7924

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 22 23 34 3

Sample Output

NOYESYESNO

Code：

#include<stdio.h>#include<string.h>//不用考虑前导0...这让我很困惑啊..Dev结果都不对还能ACchar *removepoint(char a[]){int len = strlen(a);//strchr的功能 ： //返回首次出现c的位置的指针，返回的地址是字符串在内存中//随机分配的地址再加上你所搜索的字符在字符串位置，如果s中不存在c则返回NULL if(strchr(a,'.')!=NULL){while(a[--len] == '0');if(a[len]=='.') len--;a[len+1] = '\0';}return a;}int main(){char a[15000],b[15000];while(~scanf("%s%s",a,b)){if(strcmp(removepoint(a),removepoint(b))==0) printf("YES\n");else printf("NO\n");}return 0;}