- 论坛徽章:
- 0
|
母牛数量算法
看了一下楼主的帖子,大家都在研究算法,我非常赞成不用递归, 但是这位仁兄用的循环有点多,我写了个小程序,大家给研究研究,请多提意见
int main(int argc, char *argv[])
{
long cow;
int year;
cow = 0;
year = 0;
if(argc != 2)
{
printf("year must be entered!\n" ;
exit(0);
}
sscanf(argv[1], "%d", &year);
cow = get_cow(year);
printf("----year = %d\n----cow = %u\n", year, cow);
}
int get_cow(int year)
{
long new_cow;
long total;
long cow[3];
int i;
new_cow = 0;
memset(&cow, 0x00, sizeof(cow));
cow[0] = 1;
total = 0;
for(i = 1; i <= year; i++)
{
new_cow = cow[2];
cow[2] += cow[1];
cow[1] = cow[0];
cow[0] = new_cow;
}
total =cow[0] + cow[1] + cow[2];
return total;
} |
|