一维数组，判断闰年和年月日计算和输出某年某月的天数,斐波拉契数列

**一，**一维数组要注意数组类型及其大小；
二，维数组有以下几种定义：

int ch[6]={};
int ch[6]={0};
int ch[]={};//不可以
int ch[]={1,2,3};
const int n=8;
int ch[n]={};
int ch[n]={1,2,3,4};

注意：
const int n=8;
int ch[n]={};
int ch[n]={1,2,3,4};
n在编译时替换为8

注意下面的错误写法:

const int m;//erro
const int ch[10];//erro

三，斐波那契数列的打印：

#include<stdio.h>
int main()
{const int m=6;
int ch[m]={1,1};
  for(int i=2;i<m;i++)
  {
   ch[i]=ch[i-1]+ch[i-2];
  }
  for(int i=0;i<m;i++)
  {
   printf("%p %d ",&ch[i],ch[i]);//%p或者%08X来输出地址
  }
}

输出闰年的函数及其输出某月天数的函数：

#include<stdio.h>
bool Is_Leap(int  year)
{
	 return ((year% 4 ==0 && year% 100 != 0) || (year% 400 == 0));
}
int Get_YM_Day(int year, int month) //利用查表法来表达月份对应的天数
{
	static const int date[] = { 29,31,28,31,30,31,30,31,31,30,31,30,31};
	if(month==2&&Is_Leap(year))
	//if (Is_Leap(year) && month == 2)上面的更好；
	{
		month = 0;
	}
	return date[month];
}
//int Get_YMD_Sum(int year, int month, int day)//2012,12,15
//{
//	int sum = 0;
//	if (year < 0) return -1;
//	if ((month < 1)||(month > 12)) return -2;
//	if ((day < 0) || (day > Get_YM_Day(year, month)));
//	for (int i = month-1; i > 0; i--) 
//	{
//		sum += Get_YM_Day(year, i);
//	}
//	return sum + day;
//}
int Get_YMD_Sum(int year, int month, int day)//2012,12,15{ 29,31,28,31,30,31,30,31,31,30,31,30,31}
{
	if (year < 0) return -1;
	if ((month < 1) || (month > 12)) return -2;
	if ((day < 0) || (day > Get_YM_Day(year, month)));
	static const int sum[] = { 0,0,31,59,90,120,151,181,212,243,273,304,334};
	if (Is_Leap(year)) return sum[month]+1+day;
	return sum[month] + day;
}
int main()
{
	int a = 1, b = 2, c = 3;
	int ar[3] = {a,b,c};
	printf("%d\n",Is_Leap(2010));
	printf("%d",Get_YMD_Sum(-2015, 12, 31));
	return 0;
}