1060. Are They Equal (25)
来源:互联网 发布:js数组与字符串比较 编辑:程序博客网 时间:2024/05/17 18:27
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*105 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 10100, 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.d1...dN*10^k" (d1>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.9Sample Output 1:
YES 0.123*10^5Sample Input 2:
3 120 128Sample Output 2:
NO 0.120*10^3 0.128*10^3
判断两个数以题目给定的模式表示是否一样,并且输出结果。要考虑的情况比较多,比如123,0.002,0002.2,02.200003,0.,.023等形式的数字都可能有。我这里主要分成两大类,就是大于等于1的和小于1的。对于一个以字符串形式输入的数,首先先把前面的0排除掉。如果当前字符为‘.'且后面还有数,说明小于1,就遍历字符串,找出n位有效数字,如果不够n位就补零补足n位,同时也求出指数ex。如果当前字符不是‘.',说明大于等于1,遍历字符串直到找到‘.',同时添加有效数字,和求出指数ex,然后跳过‘.',继续补全有效数字,如果最后也不足n个,就补零。最后比较有效数字就能判断两个数是否“相等“。最后按题目指定形式输出结果。
代码:
#include <iostream>#include <cstring>#include <cstdlib>#include <cstdio>#include <vector>using namespace std;int get_num(char *s,int n,string &num){int m=strlen(s);int i=0,ex;while(i<m&&s[i]=='0') i++;if(i<m&&s[i]=='.'){i++;ex=0;while(i<m&&s[i]=='0'){i++;ex--;}while(i<m&&num.size()<n){num+=s[i++];}while(num.size()<n){num+='0';}return ex;}else{ex=0;while(i<m&&s[i]!='.'){ex++;if(num.size()<n){num+=s[i];}i++;}i++;while(i<m&&num.size()<n){num+=s[i++];}while(num.size()<n){num+='0';}return ex;}}int main(){int n;char s1[105],s2[105];scanf("%d %s %s",&n,s1,s2);string res1,res2;int ex1=get_num(s1,n,res1);int ex2=get_num(s2,n,res2);if(res1[0]=='0') ex1=0;if(res2[0]=='0') ex2=0;if(res1==res2&&ex1==ex2){printf("YES 0.%s*10^%d",res1.c_str(),ex1);}else{printf("NO 0.%s*10^%d 0.%s*10^%d",res1.c_str(),ex1,res2.c_str(),ex2);}}
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- 1060. Are They Equal (25)
- CenterOS6.5(Minimal) 搭建php
- JZOJ.1764. 游戏
- spiralMatrixII
- windows搭apache+php环境
- 函数四种调用模式以及this指向
- 1060. Are They Equal (25)
- 线程池的原理及实现
- GitHub 排名前 100 的安卓项目简介
- hdu_2222_Keywords Search(AC自动机板子)
- CenterOS6.5(Minimal) 搭建Redis
- 正则表达式
- HTML有2种路径的写法:绝对路径和相对路径
- matlab 读取图片的格式
- EL表达式