Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
Register

## 绝望，重写了几次都一直WA

Posted by liweiliu at 2017-10-12 16:09:15 on Problem 1001
In Reply To:也给一些测试数据(总结了前辈的) Posted by:ljxluois at 2007-08-14 01:34:10
```#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s, a, b;//输入字符串，乘数，被乘数
int n, l;//幂，小数点位置
void init(){
l = s.find('.');
s.erase(l, 1);
l = (s.length() - l)*n;
reverse(s.begin(), s.end());
}
void multiply(){
for (int i = 0; i < a.length(); ++i)
for (int j = 0; j < b.length(); ++j){
s[i + j] += (a[i] - 48)*(b[j] - 48);
s[i + j + 1] += s[i + j] / 10;
s[i + j] %= 10;
}
for (int i = 0; i < s.length(); ++i)s[i] += '0';
}
void calculate(){
a.assign(s);
while (--n){
b.assign(s);
s = string(a.length() + b.length(), 0);
multiply();
}
reverse(s.begin(), s.end());
}
void printout(){
s.insert(s.length() - l, ".");
int start = 0, end = s.length() - 1;
while (s[start] == '0')++start;
while (s[end] == '0')--end;
s = s.substr(start, end - start + 1);
cout << s << endl;
}
int main(){
while (cin >> s >> n){
init();
calculate();
printout();
}
return 0;
}```

Followed by: