poj 2506 Tiling

原来还可以这样系列……

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);"></span>

</pre>竟然有一个叫模板的东西可以用！！<p>原谅我一个刚入门的小菜鸟！</p><p>原来大神们给我留下了这样的财富！！</p><p></p><p><strong><span style="font-size:18px;">超大数的简单加减乘除：</span></strong></p><p>版本一：</p><pre name="code" class="cpp">#include <iostream>
using namespace std;
const int Base=1000000000;  
const int Capacity=100;  
typedef long long huge;    
 
struct BigInt{  
     int Len;  
     int Data[Capacity];  
     BigInt() : Len(0) {}  
     BigInt (const BigInt &V) : Len(V.Len) { memcpy (Data, V.Data, Len*sizeof*Data);}  
     BigInt(int V) : Len(0) {for(;V>0;V/=Base) Data[Len++]=V%Base;}  
     BigInt &operator=(const BigInt &V) {Len=V.Len; memcpy(Data, V.Data, Len*sizeof*Data); return *this;}  
     int &operator[] (int Index) {return Data[Index];}  
     int operator[] (int Index) const {return Data[Index];}  
};
int compare(const BigInt &A, const BigInt &B){  
     if(A.Len!=B.Len) return A.Len>B.Len ? 1:-1;  
     int i;  
     for(i=A.Len-1;i>=0 && A[i]==B[i];i--);  
     if(i<0)return 0;  
     return A[i]>B[i] ? 1:-1;  
} 

BigInt operator+(const BigInt &A,const BigInt &B){  
     int i,Carry(0);  
     BigInt R;  
     for(i=0;i<A.Len||i<B.Len||Carry>0;i++){  
         if(i<A.Len) Carry+=A[i];  
         if(i<B.Len) Carry+=B[i]; 
         R[i]=Carry%Base;  
         Carry/=Base;  
     }  
     R.Len=i;  
     return R;  
}

BigInt operator-(const BigInt &A,const BigInt &B){  
     int i,Carry(0);  
     BigInt R;  
     R.Len=A.Len;  
     for(i=0;i<R.Len;i++){  
         R[i]=A[i]-Carry;  
         if(i<B.Len) R[i]-=B[i];  
         if(R[i]<0) Carry=1,R[i]+=Base;  
         else Carry=0;  
     }  
     while(R.Len>0&&R[R.Len-1]==0) R.Len--;  
     return R;  
} 

BigInt operator*(const BigInt &A,const int &B){  
     int i;  
     huge Carry(0);  
     BigInt R;  
     for(i=0;i<A.Len||Carry>0;i++){  
         if(i<A.Len) Carry+=huge(A[i])*B;  
         R[i]=Carry%Base;  
         Carry/=Base;  
     }  
     R.Len=i;  
     return R;  
}
istream &operator>>(istream &In,BigInt &V){  
     char Ch;  
     for(V=0;In>>Ch;){  
         V=V*10+(Ch-'0');  
         if(In.peek()<=' ') break;  
     }  
     return In;  
} 
ostream &operator<<(ostream &Out,const BigInt &V){  
     int i;  
     Out<<(V.Len==0 ? 0:V[V.Len-1]);  
     for(i=V.Len-2;i>=0;i--) for(int j=Base/10;j>0;j/=10) Out<<V[i]/j%10;  
     return Out;  
}
int main()
{  
     BigInt a,b;  
     cin>>a>>b;  
     cout<<a+b<<endl;  
     if(compare(a, b)>0) cout<<a-b<<endl;  
     else cout<<b-a<<endl;  
     cout<<a*328478<<endl<<b*982347283<<endl;  
     system("pause");  
}  

嗯，完全没看懂，心塞，但是太好用啦！！！

版本二：

惊喜

简直是把懒得要死的我想干的全干了！！

但是用法还是有很大局限性，poj总是编译错误

但还是很厉害！！！

所以，综上，我写出了超级脑残的代码，思路是当前的情况，如果剩单位一个长度的话，只有一种摆法，要是有两个单位长度的话，有三种摆法，但其中一种摆法实际上跟单位一时重了，反正我太笨画了半天图→_→

#include <iostream>
using namespace std;
const int Base=1000000000;
const int Capacity=100;
typedef long long huge;

struct BigInt{
    int Len;
    int Data[Capacity];
    BigInt() : Len(0) {}
    BigInt (const BigInt &V) : Len(V.Len) { memcpy (Data, V.Data, Len*sizeof*Data);}
    BigInt(int V) : Len(0) {for(;V>0;V/=Base) Data[Len++]=V%Base;}
    BigInt &operator=(const BigInt &V) {Len=V.Len; memcpy(Data, V.Data, Len*sizeof*Data); return *this;}
    int &operator[] (int Index) {return Data[Index];}
    int operator[] (int Index) const {return Data[Index];}
};

int compare(const BigInt &A, const BigInt &B){
    if(A.Len!=B.Len) return A.Len>B.Len ? 1:-1;
    int i;
    for(i=A.Len-1;i>=0 && A[i]==B[i];i--);
    if(i<0)return 0;
    return A[i]>B[i] ? 1:-1;
}

BigInt operator+(const BigInt &A,const BigInt &B){
    int i,Carry(0);
    BigInt R;
    for(i=0;i<A.Len||i<B.Len||Carry>0;i++){
        if(i<A.Len) Carry+=A[i];
        if(i<B.Len) Carry+=B[i];
        R[i]=Carry%Base;
        Carry/=Base;
    }
    R.Len=i;
    return R;
}

BigInt operator*(const BigInt &A,const int &B){
    int i;
    huge Carry(0);
    BigInt R;
    for(i=0;i<A.Len||Carry>0;i++){
        if(i<A.Len) Carry+=huge(A[i])*B;
        R[i]=Carry%Base;
        Carry/=Base;
    }
    R.Len=i;
    return R;
}
istream &operator>>(istream &In,BigInt &V){
    char Ch;
    for(V=0;In>>Ch;){
        V=V*10+(Ch-'0');
        if(In.peek()<=' ') break;
    }
    return In;
}
ostream &operator<<(ostream &Out,const BigInt &V){
    int i;
    Out<<(V.Len==0 ? 0:V[V.Len-1]);
    for(i=V.Len-2;i>=0;i--) for(int j=Base/10;j>0;j/=10) Out<<V[i]/j%10;
    return Out;
}

int main()
{
    BigInt x1,x2,x3;
    int n;
    while(cin>>n)
    {
        int i;
        x1=1;
        x2=1;
        if (n==0||n==1) {
            cout<<x1<<endl;
        }
        else
        {
            for (i=1; i<n; i++) {
                x3=x1*2+x2;
                x1=x2;
                x2=x3;
            }
            cout<<x3<<endl;
        }
    }
}

人笨代码长……就这样吧