Cod sursa(job #158814)
Utilizator | Data | 13 martie 2008 20:29:03 | |
---|---|---|---|
Problema | Iepuri | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<fstream.h>
ifstream f("iepuri.in");
ofstream g("iepuri.out");
long long t,a,b,c,i,j;
long long p[10000];
long long n;
int main()
{f>>t;
for(i=0;i<t;i++)
{f>>p[0]>>p[1]>>p[2]>>a>>b>>c>>n;
for(j=3;j<=n;j++)
p[j]=(a*p[j-1]+b*p[j-2]+c*p[j-3])%666013;
g<<p[n]<<"\n";
}
f.close();
g.close();
return 0;
}