Pagini recente » Borderou de evaluare (job #1339025) | Borderou de evaluare (job #2760785) | Diferente pentru problema/copii intre reviziile 3 si 2 | Borderou de evaluare (job #1186694) | Cod sursa (job #334780)
Cod sursa(job #334780)
#include <stdio.h>
int main()
{
int t[1001];
long long n,i,u=0;
freopen("koba.in","r",stdin);
freopen("koba.out","w",stdout);
scanf("%lld%d%d%d",&n,&t[1],&t[2],&t[3]);
u+=t[1]%10+t[2]%10+t[3]%10;
for (i=4;i<1001;i++)
{
t[i]=(t[i-1]%10)+(t[i-2]%10)*(t[i-3]%10);
u+=t[i]%10;
}
printf("%lld",u);
return 0;
}