POJ 1001大家帮忙看看哪里错了
代码编译能通过，测试了一些数据也通过了，但是提交之后显示Wrong Answer

代码：

#include <iostream>
#include <string>
#include <vector>
//#define MAX_NODE_LEN 75

const int MAX_NODE_LEN = 75;
using namespace std;

struct CalNode
{
int value[MAX_NODE_LEN];
int dot;
int length;

void clear()
{
for ( int i = 0; i<MAX_NODE_LEN; i++ )
{
value[i] = 0;
}
}

void TrimZero()
{
for ( int i = length -1;i>dot -1;i--)
{
if ( value[i] == 0)
{
length--;
}
else
{
break;
}
}

int trimEndStep = 0;
for ( int i = 0; i <= dot - 1; i++)
{
if ( value[i] == 0 )
{
trimEndStep ++;
}
else
{
break;
}
}

length -= trimEndStep;
dot -= trimEndStep;
for (int i = 0;i<length;i++)
{
value[i] = value[i+trimEndStep];
}
}

};

void MultiPlyCalNode( CalNode a, CalNode b, CalNode& result )
{
result.dot = a.dot + b.dot;
result.length = a.length + b.length;

result.clear();

int temp;
for ( int i = 0;i<a.length;i++ )
{
for ( int j = 0;j<b.length;j++ )
{
temp = a.value[i]*b.value[j];
result.value[i+j] += temp;
if ( result.value[i+j] >= 100 )
{
result.value[i+j+1] += result.value[i+j]/100;
result.value[i+j] = result.value[i+j] %100;
}
}
}
}

void printCalNode( CalNode node )
{
node.TrimZero();

//先输出整数
//再输出点
//再输出小数
if ( node.dot > node.length || node.length <= 0 )
{
return;
}


//输出整数
/*if ( node.dot == node.length )
{
cout << "0";
}*/
if(node.length > node.dot )
cout << node.value[node.length -1];

for( int i = node.length -2 ;i> node.dot -1;i--)
{
if (node.value[i] < 10)
{
cout<< "0";
}

cout << node.value[i];
}

if (node.dot > 0)
{
cout << ".";
}

for ( int i = node.dot -1;i>=0;i-- )
{
if (node.value[i] < 10)
{
cout << "0";
}

if ( 0 == i && (node.value[i] %10) == 0)
{
cout<< node.value[i]/10;
}
else
{
cout << node.value[i];
}

}

cout << endl;

}

int main()
{
CalNode a;
vector<CalNode> c;
string number;
int R;

while (cin >> number >> R )

{
int number1 = 0,number2 = 0;
int i ;
int addtims = 1;
int dot;

for ( i=0;i<number.size();i++ )
{
if (number[i] == '.')
{
break;
}

}

dot = i;

for ( i = number.size() - 1;i>dot; i--)
{
number1 += ( number[i] - '0' ) * addtims;
addtims *= 10;
}

if ( (number.size() - i - 1) % 2 != 0 )
{
number1 *= 10;
}

addtims = 1;
for (i = dot -1;i>=0;i--)
{
number2 += (number[i] - '0') * addtims;
addtims *= 10;
}

a.clear();
a.dot = 0;
a.length = 0;

i = 0;
while (number1 > 0)
{
a.value[i] = number1 % 100;
number1 /= 100;
a.dot ++ ;
a.length ++;
i++;
}

while (number2 > 0)
{
a.value[i] = number2 %100;
number2 /= 100;
a.length ++;
i++;
}
CalNode b;

b.clear();

b.dot = 0;
b.length = 1;
b.value[0] = 1;


for ( int i = 0;i<R;i++)
{
MultiPlyCalNode(a,b,b);
//printCalNode(b);
}

printCalNode(b);
c.push_back(b);

}

/*for ( vector<CalNode>::size_type xi = 0;xi != c.size();xi++ )
{
printCalNode(c[xi]);
}*/



return 0;
}
[解决办法]
1.0001 1

所以你到底用的100进制还是10进制？