Question

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.Place your answer in R0 at the end of your program. Can you tell me what is the reason when done debug it says running with size limit :32K .i am using Keil uVision 5. Please help me to solve this problem.

Answer 1

CODE:

#include <stdio.h>

int main()

{

int n1 = 1, n2 = 2, temp;

long int sum = 2;

while (sum <= 4000000) {

temp = n1 + n2;

n1 = n2;

n2 = temp;

if(n2 % 2 == 0) {

sum += n2;

}

}

printf("%ld\n", sum);

return 0;

}

OUTPUT

4613732

PROCESS FINISHED WITH EXIT CODE 0.