pat 1060. Are They Equal (25)

本博客介绍如何将两个数转换为科学计数法并进行比较,同时强调了精度要求的重要性。通过实例演示了如何处理不同格式的0及前导0,确保在比较时的准确性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目意思直接,要求将两个数转为科学计数法表示,然后比较是否相同  不过有精度要求

/*
test 6 
3 0.00 00.00
test 3
3 0.1 0.001
0.001=0.1*10^-2
pay 
前导0
不同格式的0
*/

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
char a[105],b[105];
struct num
{
	char s[105];
	int k;
}x,y;
struct num getn(char a[],int n)
{
	int na=strlen(a),i,j=na,k=na,t,flag=0;
	struct num x;
	memset(x.s,'0',n*sizeof(char));
	x.s[n]='\0';
	for(i=0;i<na;i++)
	{
		if(a[i]>'0'&&a[i]<='9'&&!flag)
		{
			j=i;
			flag=1;
		}
		if(a[i]=='.')k=i;
	}
//	printf("%d %d\n",j,k);
	if(j==na)
	{
		x.k=0;
	}
	else
	{
		t=0;
		for(i=j;i<na&&t<n;i++)
			if(i!=k)x.s[t++]=a[i];
			if(k>j)x.k=k-j;
			else
				x.k=k-j+1;
	}
	//printf("%s %d\n",x.s,x.k);
	return x;

}
void deal(char a[],char b[],int n)
{
	x=getn(a,n);
	y=getn(b,n);
	if(!strcmp(x.s,y.s)&&x.k==y.k)printf("YES 0.%s*10^%d\n",x.s,x.k);
	else
		printf("NO 0.%s*10^%d 0.%s*10^%d\n",x.s,x.k,y.s,y.k);
}
int main()
{

	int na,nb,i,n,t,flag;
	while(scanf("%d%s%s",&n,a,b)!=EOF)
	{
		deal(a,b,n);
	}
	return 0;
}


 

(c++题解,代码运行时间小于200ms,内存小于64MB,代码不能有注释)It’s time for the company’s annual gala! To reward employees for their hard work over the past year, PAT Company has decided to hold a lucky draw. Each employee receives one or more tickets, each of which has a unique integer printed on it. During the lucky draw, the host will perform one of the following actions: Announce a lucky number x, and the winner is then the smallest number that is greater than or equal to x. Ask a specific employee for all his/her tickets that have already won. Declare that the ticket with a specific number x wins. A ticket can win multiple times. Your job is to help the host determine the outcome of each action. Input Specification: The first line contains a positive integer N (1≤N≤10 5 ), representing the number of tickets. The next N lines each contains two parts separated by a space: an employee ID in the format PAT followed by a six-digit number (e.g., PAT202412) and an integer x (−10 9 ≤x≤10 9 ), representing the number on the ticket. Then the following line contains a positive integer Q (1≤Q≤10 5 ), representing the number of actions. The next Q lines each contain one of the following three actions: 1 x: Declare the ticket with the smallest number that is greater than or equal to x as the winner. 2 y: Ask the employee with ID y all his/her tickets that have already won. 3 x: Declare the ticket with number x as the winner. It is guaranteed that there are no more than 100 actions of the 2nd type (2 y). Output Specification: For actions of type 1 and 3, output the employee ID holding the winning ticket. If no valid ticket exists, output ERROR. For actions of type 2, if the employee ID y does not exist, output ERROR. Otherwise, output all winning ticket numbers held by this employee in the same order of input. If no ticket wins, output an empty line instead. Sample Input: 10 PAT000001 1 PAT000003 5 PAT000002 4 PAT000010 20 PAT000001 2 PAT000008 7 PAT000010 18 PAT000003 -5 PAT102030 -2000 PAT000008 15 11 1 10 2 PAT000008 2 PAT000001 3 -10 1 9999 1 -10 3 2 1 0 3 1 2 PAT000001 3 -2000 Sample Output: PAT000008 15 ERROR ERROR PAT000003 PAT000001 PAT000001 PAT000001 1 2 PAT102030
最新发布
08-12
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值