杭电 acm 2054 A==B?
2018-03-15 11:48
375 查看
A == B ?
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 118729 Accepted Submission(s): 18964
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
Author
8600 && xhd
#include<iostream>
#include<string.h>
#include<string>
using namespace std;
int spt(char x[])
{
for(int i=0;x[i]!=0;i++)
{
if(x[i]=='.')
return 1;
}
return 0;
}
void zero(char x[],int y)
{
if(spt(x))
{
int l=y-1;
while(x[l]=='0')
{
x[l]=0;
l--;
}
if(x[l]=='.')
{
x[l]=0;
l--;
}
y=l;
}
}
int main()
{
char a[100000],b[100000];
while(cin>>a>>b)
{
int l1=strlen(a),l2=strlen(b);
zero(a,l1);
zero(b,l2);
if(strcmp(a,b)==0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
} 这个刚开始看着好容易,wa了一次发现没那么简单,要判断是否有小数点以及小数点后面的0,如果是12.20000那么就将2后面的0全部去掉,再进行字符串比较即strcmp()
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 118729 Accepted Submission(s): 18964
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
Author
8600 && xhd
#include<iostream>
#include<string.h>
#include<string>
using namespace std;
int spt(char x[])
{
for(int i=0;x[i]!=0;i++)
{
if(x[i]=='.')
return 1;
}
return 0;
}
void zero(char x[],int y)
{
if(spt(x))
{
int l=y-1;
while(x[l]=='0')
{
x[l]=0;
l--;
}
if(x[l]=='.')
{
x[l]=0;
l--;
}
y=l;
}
}
int main()
{
char a[100000],b[100000];
while(cin>>a>>b)
{
int l1=strlen(a),l2=strlen(b);
zero(a,l1);
zero(b,l2);
if(strcmp(a,b)==0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
} 这个刚开始看着好容易,wa了一次发现没那么简单,要判断是否有小数点以及小数点后面的0,如果是12.20000那么就将2后面的0全部去掉,再进行字符串比较即strcmp()
相关文章推荐
- 杭电ACM 2054 A == B ?
- 杭电ACM 2054:A == B ?
- 杭电 ACM 1003 python实现
- 杭电ACM 1297 Children’s Queue
- 杭电ACM2037——今年暑假不AC
- 杭电ACM 第106题 Tick and Tick
- 杭电acm--2042
- 杭电acm:最小公倍数(附源码)
- 杭电ACM1.2.1
- 杭电acm--2047
- 杭电ACM 1000
- 杭电 ACM 2035
- 杭电ACM1020 VS 1039
- 【杭电ACM】1.2.1 Biker's Trip Odometer
- 杭电acm 2041
- 杭电acm 1037题
- 杭电 acm 1009 FatMouse' Trade
- 杭电ACM 今年暑假不AC 2037(关于最简单的贪心算法)
- 杭电 acm 1013 Digital Roots
- 杭电ACM 1030 Delta-wave java代码解析