> #include <iostream>
> using namespace std;
> inline int fai(int a,int b,int c,int d,int e,int f,int g,int h,int i){
>     int temp;
>     if(i==0){return a;}
>     if(i==1){return b;}
>     if(i==2){return c;}
>     if((i>=3)&&(i%2==1)){
>                          temp=d*fai(a,b,c,d,e,f,g,h,i-1)+e*fai(a,b,c,d,e,f,g,h,i-2)-f*fai(a,b,c,d,e,f,g,h,i-3);
>                          while(temp<0){
>                                        temp=temp+g;
>                                        
>                                        }
>                                        return temp%g;
>                          }
>     if((i>=3)&&(i%2==0)){
>                          temp=f*fai(a,b,c,d,e,f,g,h,i-1)-d*fai(a,b,c,d,e,f,g,h,i-2)+e*fai(a,b,c,d,e,f,g,h,i-3);
>                          while(temp<0){
>                                        temp=temp+h;
>                                        
>                                        }
>                                        return temp%h;
>                          }                     
>     }
> int main()
> {
> int a,b,c,d,e,f,g,h,i,num,count=1;
>     cin>>num;
>     while(count<=num){
>     cin>>a>>b>>c>>d>>e>>f>>g>>h>>i;
>     cout<<fai(a,b,c,d,e,f,g,h,i)<<endl;
>     count++;
>     }
> system("PAUSE");
> return 0;    
> }
直接数组递推

• Re:递归超时啊？怎么办？高人帮忙啊。。。 (8) cici123 2006-08-27 15:08:22