poj-2696

负数模正数

#include<iostream>#include<cstring>#include<cstdio>#include<fstream>using namespace std;int main(){      int t,a,b,c,d,e,f,g,h,i,k,ss[1024];  //fstream cin("d:\\test.txt");cin>>t;    while(t--)   {       cin>>a>>b>>c>>d>>e>>f>>g>>h>>i;        ss[0]=a;        ss[1]=b;        ss[2]=c;        for(k=3;k<=i;k++)        {           if(k%2==1)                {ss[k]=(d*ss[k-1]+e*ss[k-2]-f*ss[k-3])%g;      if(ss[k]<0)ss[k]+=g;}else                {ss[k]=(f*ss[k-1]-d*ss[k-2]+e*ss[k-3])%h;if(ss[k]<0)ss[k]+=h;}}       cout<<ss[i]<<endl;    }   return 0;}