#include <stdio.h>
// Example: left = 2, right = 8;
// Explanation: F(2) + F(3) + F(4) + F(5) + F(6) + F(7) + F(8) = 1 + 2 + 3 + 5 + 8 + 13 + 21 = 53
// Function to compute Fibonacci numbers up to n
unsigned long long fibonacci(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
unsigned long long prev = 0, curr = 1;
for (int i = 2; i <= n; i++) {
unsigned long long next = prev + curr;
prev = curr;
curr = next;
}
return curr;
}
// Function to calculate sum of Fibonacci numbers from index L to R (inclusive)
unsigned long long sumFibonacciRange(int L, int R) {
// If the range is invalid (e.g., L > R), return 0
if (L > R) return 0;
/*
Mathematical identity:
Sum(F_L + F_(L+1) + ... + F_R) = F_(R+2) - F_(L+1)
Explanation:
- The sum of the first n Fibonacci numbers is F_(n+2) - 1.
- So, the sum from F_L to F_R can be derived by subtracting:
(sum of first R terms) - (sum of first (L-1) terms)
= (F_(R+2) - 1) - (F_(L+1) - 1)
= F_(R+2) - F_(L+1)
*/
return fibonacci(R + 2) - fibonacci(L + 1);
}
int main() {
int left = 2, right = 8;
unsigned long long result = sumFibonacciRange(left, right);
printf("Sum of Fibonacci numbers from index %d to %d = %llu\n", left, right, result);
return 0;
}
/*
run:
Sum of Fibonacci numbers from index 2 to 8 = 53
*/
