Pagini recente » Cod sursa (job #1778776) | Cod sursa (job #1318778) | Cod sursa (job #1534511) | Cod sursa (job #233526) | Cod sursa (job #3258788)
#include <fstream>
using namespace std;
ifstream fin("koba.in");
ofstream fout("koba.out");
int v[1100], sp[1100], sp2[1100];
int main()
{
int n, t1, t2, t3, ii, jj;\
bool ok=1;
long long sum=0;
fin >> n;
fin >> v[1] >> v[2] >> v[3];
sp[1]=v[1]%10;
sp[2]=v[2]%10+v[1]%10;
sp[3]=v[3]%10+v[2]%10+v[1]%10;
for(int i=4; i<=1000; i++)
{
v[i]=(v[i-1]+v[i-2]*v[i-3])%10;
sp[i]=v[i]+sp[i-1];
}
for(int i=1; i<=1000; i++)
{
for(int j=i+1; j<=1000; j++)
{
if(v[i]==v[j]&&v[i+1]==v[j+1]&&v[i+2]==v[j+2])
{
ii=i;
jj=j;
ok=0;
break;
}
}
if(ok==0)
break;
}
for(int i=ii; i<jj; i++)
{
sum+=v[i];
sp2[i-ii+1]=v[i]+sp2[i-ii];
}
fout << sp[ii-1]+(n-(ii-1))/(jj-ii)*sum+sp2[(n-(ii-1))%(jj-ii)];
return 0;
}