1024.科学记数法
#include <iostream>
#include<string>
using namespace std;
int main()
{
string str;
cin >> str;
int eIndex= str.find('E');
string front = str.substr(1, eIndex - 1);
int exponent = stoi(str.substr(eIndex + 1));
if (str[0] == '-') cout << str[0];
if (exponent < 0)
{
cout << "0.";
for (int i = 1; i < abs(exponent); i++)
{
cout << 0;
}
for (int i = 0; i < front[i]; i++)
{
if (front[i] != '.') cout << front[i];
}
}
else
{
int i = 2;
int cnt = 0;
cout << front[0];
for ( i = 2; i < front.length()
&&cnt<exponent; i++, cnt++)
{
cout << front[i];
}
if (i != front.length())
{
cout << '.';
for (int j = i; j < front.length(); j++)
cout << front[j];
}
else
{
for (int j = 0; j < exponent - cnt; j++)
cout << 0;
}
}
return 0;
}
柳神的代码:
```cpp
#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;
}