for(i=0;i<top;i++)num2=num2+stack[i]*power(top-i-1);
switch(opsignal)
{
case 1:reasult=num1+num2;break;
case 2:reasult=num1-num2;break;
case 3:reasult=num1*num2;break;
case 4:reasult=num1/num2;break;
}
}
for(i=0;i<top;i++)reasult=reasult+stack[i]*power(top-i-1);
if(top>8)error=1;
display(reasult);
}
}
//
uchar lenth(long int n)
{
uchar i,l;
for(i=0;i<8;i++)if(n/power(i)==0){l=i;break;}
return l;
}
//
long int power(uchar n)
{
uchar i;
long int p=1;
for(i=0;i<n;i++)p=p*10;
return p;
for(i=0;i<top;i++)num2=num2+stack*power(top-i-1);
switch(opsignal)
{
case 1:reasult=num1+num2;break;
case 2:reasult=num1-num2;break;
case 3:reasult=num1*num2;break;
case 4:reasult=num1/num2;break;
}
}
for(i=0;i<top;i++)reasult=reasult+stack*power(top-i-1);
if(top>8)error=1;
display(reasult);
}
}
//
uchar lenth(long int n)
{
uchar i,l;
for(i=0;i<8;i++)if(n/power(i)==0){l=i;break;}
return l;
}
//
long int power(uchar n)
{
uchar i;
long int p=1;
for(i=0;i<n;i++)p=p*10;
return p;
for(i=0;i<top;i++)num2=num2+stack*power(top-i-1);
switch(opsignal)
{
case 1:reasult=num1+num2;break;
case 2:reasult=num1-num2;break;
case 3:reasult=num1*num2;break;
case 4:reasult=num1/num2;break;
}
}
for(i=0;i<top;i++)reasult=reasult+stack*power(top-i-1);
if(top>8)error=1;
display(reasult);
}
}
//
uchar lenth(long int n)
{
uchar i,l;
for(i=0;i<8;i++)if(n/power(i)==0){l=i;break;}
return l;
}
//
long int power(uchar n)
{
uchar i;
long int p=1;
for(i=0;i<n;i++)p=p*10;
return p;