#include<iostream>
#include<string>
using namespace std;
int main(int argc, char* argv[])
{
string r;
int n, dian;
const int len = 160;
short result[len], jieguo[len], chengshu[6];
while (cin>>r>>n)
{
int len1 = 0;
for (int i = 0; i < len; ++i)jieguo[i] = result[i] = 0;
for (int i = 0; i < 6; ++i)chengshu[i] = 0;
dian = 0;
string::size_type pos = r.find(".");
if (pos != string::npos)dian = (5 - pos)*n;
for (int i = 5, j = 0; i >= 0; --i)
{
if (r[i] != '.')
{
jieguo[j] = result[j] = chengshu[j] = r[i] - '0';
++j;
}
}
while (n>=2)
{
--n;
for (int i = 0; i < len; ++i)result[i] = 0;
for (int i = 0; i < 5; ++i)
{
int c;
for (int j = 0; j < len; ++j)
{
if (chengshu[i] == 0)break;
c = chengshu[i] * jieguo[j];
result[i + j] += c;
for (int t = i + j; result[t] > 9; ++t)
{
result[t + 1] += result[t] / 10;
result[t] = result[t] % 10;
}
}
}
for (int i = 0; i < len; ++i) jieguo[i]=result[i];
}
/*int firstindex = -1;
for (int i = len - 1; i >= dian; --i)
{
if (result[i] > 0)
{
firstindex = i;
break;
}
}
int lastindex = -1;
for (int i = 0; i < dian; ++i)
{
if (result[i] > 0)
{
lastindex = i;
break;
}
}
if (firstindex != -1)
{
while (firstindex >= dian)
{
cout << result[firstindex];
--firstindex;
}
}
if (lastindex != -1)
{
cout << '.';
--dian;
while (dian>=lastindex)
{
cout << result[dian];
--dian;
}
}
cout << endl;
*/
int firstindex = -1;
for (int i = len - 1; i >= dian; --i)
{
if (jieguo[i] > 0)
{
firstindex = i;
break;
}
}
int lastindex = -1;
for (int i = 0; i < dian; ++i)
{
if (jieguo[i] > 0)
{
lastindex = i;
break;
}
}
if (firstindex != -1)
{
while (firstindex >= dian)
{
cout << jieguo[firstindex];
--firstindex;
}
}
if (lastindex != -1)
{
cout << '.';
--dian;
while (dian>=lastindex)
{
cout << jieguo[dian];
--dian;
}
}
cout << endl;
}
return 0;
}
参见:http://blog.csdn.net/shaw1994/article/details/12273987