UVA - 748 - Exponentiation

#include<iostream>//如果输出是整数,不要输出小数点。
#include<ctype.h>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
const int maxn=1000;
struct bign
{
    int len,s[maxn];
    bign()
    {
        memset(s,0,sizeof(s));
        len=1;
    }
    bign operator = (const char *num)
    {
        len=strlen(num);
        for(int i=0;i<len;i++)s[i]=num[len-i-1]-'0';
        return *this;
    }
    bign operator = (int num)
    {
        char s[maxn];
        sprintf(s,"%d",num);
        *this=s;
        return *this;
    }
    bign (int num)
    {
        *this=num;
    }
    bign (const char *num)
    {
        *this=num;
    }
    string str() const
    {
        string res="";
        for(int i=0;i<len;i++)
        res=(char)(s[i]+'0')+res;
        if(res=="")res="0";
        return res;
    }
    bign operator + (const bign& b) const
    {
        bign c;
        c.len=0;
        for(int i=0,g=0;g||i<max(len,b.len);i++)
        {
            int x=g;
            if(i<len)x+=s[i];
            if(i<b.len)x+=b.s[i];
            c.s[c.len++]=x%10;
            g=x/10;
        }    
        return c;
    }
    
    void clean()
    {
        while(len>1&&!s[len-1])len--;
    } 
       
    bign operator * (const bign& b)
    {
        bign c; c.len = len + b.len;
        for(int i = 0; i < len; i++)
           for(int j = 0; j < b.len; j++)
             c.s[i+j] += s[i] * b.s[j];
          for(int i = 0; i < c.len-1; i++){
          c.s[i+1] += c.s[i] / 10;
          c.s[i] %= 10;
    }
    c.clean();
    return c;
   }
    bign operator - (const bign& b) const
    {
        bign c;
        c.len=0;
        for(int i=0,g=0;g||i<max(len,b.len);i++)
        {
            int x=s[i]-g;
            if(i<b.len)x-=b.s[i];
            if(x>=0)g=0;
            else
            {
                g=1;
                x+=10;
            }
            c.s[c.len++]=x;    
        }
        c.clean();
        return c;
    }
    bign operator += ( const bign& b)
    {
        *this=*this+b;
        return *this;
    }
    bign operator *= ( const bign& b)
    {
        *this=*this*b;
        return *this;
    }
    bool operator < (const bign& b) const
    {
        if(len!=b.len)return len<b.len;
        for(int i=len-1;i>=0;i--)
        if(s[i]!=b.s[i])return s[i]<b.s[i];
        return false;
    }
    bool operator > (const bign& b) const
    {
        return b<*this;
    }
    bool operator <= (const bign& b) const
    {
        return !(b<*this);
    }
    bool operator >= (const bign& b) const
    {
        return !(*this>b);
    }
    bool operator != (const bign& b) const
    {
        return b<*this||*this <b;
    } 
    bool operator == (const bign& b) const
    {
        return !(b<*this)&&!(*this<b);
    }                                
};
istream& operator >> (istream &in,bign &x)
{
    string s;
    in>>s;
    x=s.c_str();
    return in;
}
ostream& operator << (ostream &out,const bign& x)
{
    out << x.str();
    return out;
} 
int CreatDot(bign &x,int dot,int n)
{
    int pos;
    pos=dot*n;
    if(pos<x.len)
    {
        for(int i=x.len+2;i>=pos;i--)
        {
            if(i!=pos)
            {
                x.s[i]=x.s[i-1];
            }
            else
            {
                x.s[i]=-2;//'.'
            }
        }
        x.len++;
    }
    else
    {
        for(int i=pos-1;i>=x.len;i--)
        {
            x.s[i]=0;
        }                    
        x.s[pos]=-2;//'.'
        x.len=pos+1;
    }
    return 0;
}  
int CutNil(bign &x)
{
    for(int i=0;i<=x.len+20;i++)
    {
        if(x.s[0]==0) 
        {
            for(int j=0;j<x.len;j++)
            {
                x.s[j]=x.s[j+1];
            }
            x.len--;    
        }
        else if(x.s[0]==-2)
        {
            for(int j=0;j<x.len;j++)
            {
                x.s[j]=x.s[j+1];
            }    
            x.len--;
        }    
        else
        {
            return 0;
        }    
    }      
    return 0;
}                                                       
int main()
{
    bign c,x;
    char s[10],r[6],save[4];
    int n,tag,dot;
    while(gets(s))
    {
        tag=0;
        dot=0;
        for(int i=0;i<6;i++)
        {
            if(s[i]!='.')r[tag++]=s[i];
            else dot=i;
        } 
        dot=5-dot;
        c=r; 
        x=c;  
        for(int i=7;i<10;i++)
        {
            save[i-7]=s[i];
        }
        n=atoi(save);
        for(int i=1;i<n;i++)
        {
            x*=c;
        }    
        CreatDot(x,dot,n);
        CutNil(x);
        cout<<x<<endl;
    }                                                  
    return 0;
}    


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值