PAT (Advanced Level) Practise 1073 Scientific Notation(20)
来源:互联网 发布:stm8s数据手册 编辑:程序博客网 时间:2024/05/16 15:12
1073. Scientific Notation (20)
Scientific notation is the way that scientists easily handle very large numbers or very small numbers. The notation matches the regular expression [+-][1-9]"."[0-9]+E[+-][0-9]+ which means that the integer portion has exactly one digit, there is at least one digit in the fractional portion, and the number and its exponent's signs are always provided even when they are positive.
Now given a real number A in scientific notation, you are supposed to print A in the conventional notation while keeping all the significant figures.
Input Specification:
Each input file contains one test case. For each case, there is one line containing the real number A in scientific notation. The number is no more than 9999 bytes in length and the exponent's absolute value is no more than 9999.
Output Specification:
For each test case, print in one line the input number A in the conventional notation, with all the significant figures kept, including trailing zeros,
Sample Input 1:+1.23400E-03Sample Output 1:
0.00123400Sample Input 2:
-1.2E+10Sample Output 2:
-12000000000
题意:给出一个数的科学表示法,求出这个数
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;char ch[1000000];int main(){while (~scanf("%s", ch)){int k=-1,cnt=0,kk;for (int i = 0; ch[i]; i++){if (k != -1){cnt = cnt * 10 + ch[i] - '0';}if (ch[i] == 'E') k = i,i++;if (ch[i] == '.') kk = i;}if (ch[k + 1] == '-') cnt = -cnt;if (!cnt){for (int i = ch[i] == '+' ? 1 : 0; i < k; i++)printf("%c", ch[i]);}else if (cnt > 0){if (ch[0] == '-') printf("%c", ch[0]);if (cnt < k - kk - 1){for (int i = 1; i <= kk+cnt; i++)if (ch[i] != '.') printf("%c", ch[i]);printf(".");for (int i = kk + cnt + 1; i < k; i++)printf("%c", ch[i]);}else{for (int i = 1; i < k; i++)if (ch[i] != '.') printf("%c", ch[i]);for (int i = 1; i <= cnt - (k - kk - 1); i++) printf("0");}}else{cnt = -cnt;if (ch[0] == '-') printf("%c", ch[0]);if (kk - 1 > cnt){for (int i = 1; i < kk - cnt; i++) printf("%c", ch[i]);printf(".");for (int i = kk - cnt; i < k; i++)if (ch[i] != '.') printf("%c", ch[i]);}else{printf("0.");for (int i = 1; i <= cnt - (kk - 1); i++) printf("0");for(int i=1;i<k;i++)if (ch[i] != '.') printf("%c", ch[i]);}}printf("\n");}return 0;}
- PAT (Advanced Level) Practise 1073 Scientific Notation (20)
- PAT (Advanced Level) Practise 1073 Scientific Notation(20)
- Pat(Advanced Level)Practice--1073(Scientific Notation)
- PAT Advanced Level 1073. Scientific Notation (20)
- 【PAT】【Advanced Level】1073. Scientific Notation (20)
- 1073. Scientific Notation (20)【字符串操作】——PAT (Advanced Level) Practise
- 【C++】PAT(advanced level)1073. Scientific Notation (20)
- PAT (Advanced Level) 1073. Scientific Notation (20) 科学计数法
- PAT (Advanced) 1073. Scientific Notation (20)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- 007
- linux下SVN服务端配置
- thinkphp四种url访问方式详解
- iOS开发之ReactiveCocoa框架(RAC)第一篇
- sourcelnsight
- PAT (Advanced Level) Practise 1073 Scientific Notation(20)
- hibernate缓存
- SpringMvc+POI 处理Excel的导入操作
- 如果偷偷把自己的工作自动化,不告诉老板,有错吗?
- 自己出的垃圾RMQ COGS-组卡组
- 注解在Android中的应用
- 合并石头
- struts2拦截器
- Java设计模式-简单工厂模式