#include <iostream>
#include <cstdio>
#include <string.h>
#include <string>
using namespace std;
#define MAXN 500 + 50
int a[MAXN], b[MAXN];
int c[MAXN];
int record;
void output(int temp[], int t)
{
int u = 0, v = 0;
for (int i = MAXN - 1; i >= 0; i--)
{
if (temp[i] != 0)
{
u = i;
break;
}
}
if (record != -1)
{
for (int i = 0; i < MAXN; i++)
{
if (temp[i] != 0)
{
v = i;
break;
}
}
}
if (record > u)
{
cout << ".";
for (int i = 0; i < record - u - 1; i++)
{
cout << '0';
}
for (int i = u; i >= v; i--)
{
cout << temp[i];
}
cout << endl;
}
else
{
for (int i = u; i >= v; i--)
{
cout << temp[i];
if (i == record)
{
cout << '.';
}
}
cout << endl;
}
}
void input()
{
string str;
char ch;
int k;
while (cin >> str >> k)
{
int len = str.length();
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
record = -1;
for (int i = len - 1, j = 0; i >= 0; i--)
{
if (str[i] == '.')
{
record = len - i - 1;
continue;
}
b[j] = a[j] = str[i] - '0';
j++;
}
if (record != -1)
{
record = record * k;
}
if (k == 1)
{
output(a, record);
continue;
}
else
{
for (int l = 0; l < k - 1; l++)
{
memset(c, 0, sizeof(c));
for (int i = 0; i < MAXN; i++)
{
for (int j = 0; j < MAXN; j++)
{
c[i + j] += a[i] * b[j];
}
}
for (int i = 0; i < MAXN; i++)
{
if (c[i] >= 10)
{
int t = c[i] / 10;
c[i] %= 10;
c[i + 1] += t;
}
}
for (int i = 0; i < MAXN; i++)
{
a[i] = c[i];
}
}
}
output(c, record);
}
}
int main()
{
input();
return 0;
}
ACM->uva748
最新推荐文章于 2017-01-11 10:46:54 发布