#include <stdio.h>
 
int getFibonacci(int n){
 
	int last = 0;
	int secondlast = 0;
 
	int result = 0;
 
	for (int i = 0; i <= n; i++){
 
		if (i == 0){
			result = 0;
		}
		else if (i == 1){
			result = 0; //introducing bug
			last = 1;
		}
 
		else{
 
			result = last + secondlast;
			secondlast = last;
			last = result;
		}
 
	}
 
	return result;
 
 
}
 
int main(void) {
 
 
	for(int n = 0; n < 15; n++){
 
		printf("Fibonacci number for index %d is %d \n", n, getFibonacci(n));
	}
 
	return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgZ2V0Rmlib25hY2NpKGludCBuKXsKCQoJaW50IGxhc3QgPSAwOwoJaW50IHNlY29uZGxhc3QgPSAwOwoJCglpbnQgcmVzdWx0ID0gMDsKCQoJZm9yIChpbnQgaSA9IDA7IGkgPD0gbjsgaSsrKXsKCQkKCQlpZiAoaSA9PSAwKXsKCQkJcmVzdWx0ID0gMDsKCQl9CgkJZWxzZSBpZiAoaSA9PSAxKXsKCQkJcmVzdWx0ID0gMDsgLy9pbnRyb2R1Y2luZyBidWcKCQkJbGFzdCA9IDE7CgkJfQoJCQoJCWVsc2V7CgkJCQoJCQlyZXN1bHQgPSBsYXN0ICsgc2Vjb25kbGFzdDsKCQkJc2Vjb25kbGFzdCA9IGxhc3Q7CgkJCWxhc3QgPSByZXN1bHQ7CgkJfQoJCQoJfQoJCglyZXR1cm4gcmVzdWx0OwoJCgkKfQoKaW50IG1haW4odm9pZCkgewoJCgkKCWZvcihpbnQgbiA9IDA7IG4gPCAxNTsgbisrKXsKCQkKCQlwcmludGYoIkZpYm9uYWNjaSBudW1iZXIgZm9yIGluZGV4ICVkIGlzICVkIFxuIiwgbiwgZ2V0Rmlib25hY2NpKG4pKTsKCX0KCglyZXR1cm4gMDsKfQo=