1060 Are They Equal(STL,string,长小数)

解题思路:
输入浮点数时分为两种形式,a: 0.XXXX和b: 123.XXXX,即小数点前为0和非0,据此分成两类,找出有效数字指数e,若相等输出YES······,否则NO······
注意1:
可能会出现形如00001.0000123形式的浮点数,有多个先导0的形式
注意2:
对于a类,循环遍历,遇到0和小数点用 erase() 擦除,小数点后每右移一位 e–,直至遇到非零数字;
对于 b类,循环遍历,遇到0用 erase() 擦除,直至遇到非零数字,寻找小数点擦除,每右移一位 e++

If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×10​5​​ with simple chopping. Now given the number of significant digits on a machine and two float numbers, you are supposed to tell if they are treated equal in that machine.
Input Specification:

Each input file contains one test case which gives three numbers N, A and B, where N (<100) is the number of significant digits, and A and B are the two float numbers to be compared. Each float number is non-negative, no greater than 10​100​​, and that its total digit number is less than 100.
Output Specification:

For each test case, print in a line YES if the two numbers are treated equal, and then the number in the standard form 0.d[1]…d[N]*10^k (d[1]>0 unless the number is 0); or NO if they are not treated equal, and then the two numbers in their standard form. All the terms must be separated by a space, with no extra space at the end of a line.

Note: Simple chopping is assumed without rounding.

#include<cstdio>
#include<iostream> 
#include<string>
int n;
using namespace std;
string deal(string s,int& e){
	int k=0;
	while(s.length()>0&&s[0]=='0'){
		s.erase(s.begin());
	}
	if(s[0]=='.'){
		s.erase(s.begin());
		while(s.length()>0&&s[0]=='0'){
		s.erase(s.begin());
		e--;
		}
	}else{
		while(k<s.length()&&s[k]!='.'){
			k++;
			e++;
		}
		if(k<s.length())s.erase(s.begin()+k);
	} 
	if(s.length()==0)e=0;
	int num=0;
	k=0;
	string sum;
	while(num<n){
		if(k<s.length()) sum+=s[k++];
		else sum+='0';
		num++; 
	}
	return sum;
}
int main(){
	string s1,s2;
	int e1=0,e2=0;
	cin>>n>>s1>>s2;
	string d1=deal(s1,e1);
	string d2=deal(s2,e2);
	if(d1==d2&&e1==e2)
	cout<<"YES 0."<<d1<<"*10^"<<e1<<endl;
	else cout<<"NO 0."<<d1<<"*10^"<<e1<<" 0."<<d2<<"*10^"<<e2<<endl;
}

example1

3 12300 12358.9
YES 0.123*10^5

example2

3 120 128
NO 0.120*10^3 0.128*10^3

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值