试利用循环队列编写求k阶斐波那契序列中前n+1项的算法。

要求满足：

(注意：本题所用循环队列的容量仅为k, 则在算法执行结束时，留在循环队列中的元素应是所求k阶斐波那契序列中的最后k项)-Try using a circulating queue write seeking algorithms k n+ 1-order Fibonacci term lease before that sequence.

Requirements are met:

(Note: This question of the capacity of only circular queue element k, at the end of the algorithm execution, stay in the loop with the queue should be required sequence of order k Fibonacci last item k)