递归类别hduoj2018(母牛的故事)

题意：http://acm.hdu.edu.cn/showproblem.php?pid=2018php 解答:spa #include<stdio.h>get int cow(int a)io {di          if(a<5)return a;while          else return cow(a-1)+cow(a-3);co }acm int main()return {pr

>>阅读原文<<