【数据结构作业】k阶斐波那契数列

#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
int k, m, arr[N];

int main()
{
	printf("输入k，m:\n");
	cin >> k >> m;
	
	printf("结果为:\n");
		
	for(int i = 0; i <= m; i ++ )
		if(i < k - 1)
		arr[i] = 0;
		else if(i == k - 1)
		arr[i] = 1;
		else
		for(int j = 1; j <= k; j ++ )
			arr[i] += arr[i - j];
			
	printf("%d", arr[m]);
	return 0;
}

balabalabalabalabalabalabalabalabalabalabalabalabalabala