Cod sursa(job #1514539)
Utilizator | Data | 31 octombrie 2015 12:04:33 | |
---|---|---|---|
Problema | Iepuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int A,B,C,i,T;
long zi[200000],N,a,b,c,k;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
f>>T;
for(i=1;i<=T;i++)
{
a=2; b=1; c=0; k=2;
f>>zi[0]>>zi[1]>>zi[2]>>A>>B>>C>>N;
while(k!=N)
{
zi[++k]=A*zi[a]+B*zi[b]+C*zi[c];
a++; b++; c++;
}
g<<zi[N]%666013<<endl;
for(k=1;k<=200000;k++)
zi[k]=0;
}
f.close();
g.close();
return 0;
}