这个求斐波那契时间复杂度，求解

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//DO NOT edit this line
int f;
int Fibonacci(int k, int m) {
// Add your code here

int a[100],sum;

//异常处理
if(k < 2||m < 0) return -1;

if(m < k-1) f = 0;

else{
if(m == k-1) f = 1;
else{
//前k-1项都为0
for(int i = 0;i < k-1;i++) a[i] = 0;

    //第k-1项为1
    a[k-1] = 1;
    
    //前k项和为下一项
    for(int j = k;j <= m;j++){
      
      sum = 0;
      
      for(int i = j-k;i < j;i++) sum += a[i];
      
      a[j] = sum;
    }
    
    f = a[m];
  }
}

return 1;

}
int main(void){
Fibonacci(5, 7);
printf("%d\n",Fibonacci(5, 7));
return 0;
}