1073 Scientific Notation
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 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-03
Sample Output 1:
0.00123400
Sample Input 2:
-1.2E+10
Sample Output 2:
-12000000000
总结:这道题目在乙级已经写过了,没有什么难度,直接做就可以了(有个需要注意的点是当科学计数法的指数小于小数点的位数时,需要特殊处理一下)
代码:
#include <iostream>
using namespace std;
int main(){
string s,t;
int sign=0;//1表示正号
int w=0,i;//表示指数大小
getline(cin,s);
if(s[0]=='-') printf("-");
for(i=1;s[i]!='E';i++){
if(s[i]=='.') continue;
t+=s[i];
}
if(s[++i]=='+') sign=1;
for(++i;s[i];i++) w=w*10+s[i]-'0';
if(sign){
if(w<t.size()-1){
printf("%c",t[0]);
for(int j=0;j<w;j++) printf("%c",t[j+1]);
printf(".");
for(int j=w+1;j<t.size();j++) printf("%c",t[j]);
}
else{
cout << t;
for(int j=0;j<w+1-t.size();j++) printf("0");
}
}
else{
printf("0.");
for(int j=0;j<w-1;j++) printf("0");
cout << t;
}
return 0;
}
柳神的代码:
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int i = 0;
while (s[i] != 'E') i++;
string t = s.substr(1, i-1);
int n = stoi(s.substr(i+1));
if (s[0] == '-') cout << "-";
if (n < 0) {
cout << "0.";
for (int j = 0; j < abs(n) - 1; j++) cout << '0';
for (int j = 0; j < t.length(); j++)
if (t[j] != '.') cout << t[j];
} else {
cout << t[0];
int cnt, j;
for (j = 2, cnt = 0; j < t.length() && cnt < n; j++, cnt++) cout << t[j];
if (j == t.length()) {
for (int k = 0; k < n - cnt; k++) cout << '0';
} else {
cout << '.';
for (int k = j; k < t.length(); k++) cout << t[k];
}
}
return 0;
}
好好学习,天天向上!
我要考研!