Pat(Advanced Level)Practice--1060(Are They Equal)

Pat1060代码

题目描述：

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⁵ 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¹⁰⁰, 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₁...d_N*10^k" (d₁>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.

Sample Input 1:

3 12300 12358.9

Sample Output 1:

YES 0.123*10^5

Sample Input 2:

3 120 128

Sample Output 2:

NO 0.120*10^3 0.128*10^3

AC代码：

浮点数的科学计数法，纯字符串的比较；

下面是几个测试用例：

1.有前导0的情况 例如：

3 00000012.3 0000001.1
NO 0.123*10^2 0.11*10^1（太坑，一点提示也没有）

2.还有就是当位数不足N位时，不需要补全 ， 如上的 0000001.1

3.0的不同表示，如：

5 0000000 0000000.000000
YES 0.00000*10^0

其实这题有些搞笑， 如下：

4   00000012.0 0000012.00
NO 0.120*10^2 0.1200*10^2

同样是0.12不相等。。。  纯字符串比较，题目要求不删除小数部分的后导0

#include
#include
#define MAX 105

using namespace std;

int Process(char str[],int n,char ret[])
{
	int i=0,j=0;
	int exp=0;
	while(str[i]=='0')//去掉前面的0
		i++;
	if(str[i]=='.')//型如0000000.000*****的浮点数
	{
		i++;
		while(str[i]=='0')
		{
			i++;
			exp--;
		}
		if(str[i]=='\0')//0的另一种形式如00000.000000
		{
			int k;
			exp=0;
			for(k=0;k