1060 Are They Equal (25)

最新推荐文章于 2024-08-05 16:22:53 发布

ysq96

最新推荐文章于 2024-08-05 16:22:53 发布

阅读量89

点赞数

本文链接：https://blog.csdn.net/ysq96/article/details/81121850

版权

PAT 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

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.

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

思路：

给出两个数，问将它们写成保留N位小数的科学计数法后是否相等。如果相等，输出YES，输出他们的科学记数法表示方法。如果不相等输出NO，分别输出他们的科学计数法

10的0次方和1次方都要写。
– 题目中说，无需四舍五入。
– 数组开大点，虽然只有100位，但是很有可能前面的0很多导致根本不止100位。

C++：

#include <iostream>
#include <cstring>
using namespace std;
int main() {
	int n, p = 0, q = 0;
	char a[10000], b[10000], A[10000], B[10000];
	scanf("%d%s%s", &n, a, b);
	int cnta = strlen(a), cntb = strlen(b);
	for(int i = 0; i < strlen(a); i++) {
		if(a[i] == '.') {
			cnta = i;
			break;
		}
	}
	for(int i = 0; i < strlen(b); i++) {
		if(b[i] == '.') {
			cntb = i;
			break;
		}
	}
	int indexa = 0, indexb = 0;
	while(a[p] == '0' || a[p] == '.') p++;
	while(b[q] == '0' || b[q] == '.') q++;
	if(cnta >= p)
		cnta = cnta - p;
	else
		cnta = cnta - p + 1;
	if(cntb >= q)
		cntb = cntb - q;
	else
		cntb = cntb - q + 1;
	if(p == strlen(a))
		cnta = 0;
	if(q == strlen(b))
		cntb = 0;
	while(indexa < n) {
		if(a[p] != '.' && p < strlen(a))
			A[indexa++] = a[p];
		else if(p >= strlen(a))
			A[indexa++] = '0';
		p++;
	}
	while(indexb < n) {
		if(b[q] != '.' && q < strlen(b))
			B[indexb++] = b[q];
		else if(q >= strlen(b))
			B[indexb++] = '0';
		q++;
	}
	if(strcmp(A, B) == 0 && cnta == cntb)
		printf("YES 0.%s*10^%d", A, cnta);
	else
		printf("NO 0.%s*10^%d 0.%s*10^%d" , A, cnta, B, cntb);
	return 0;
}