黑色星期五

在西方，星期五和数字13都代表着坏运气，两个不幸的个体最后结合成超级不幸的一天。所以，不管哪个月的十三日又恰逢星期五就叫“黑色星期五”。

输入：

    年份

输出：

    判断该年是否包含黑色星期五，如包含，给出具体日期

测试输入

2006

测试输出

There are 2 Black Fridays in year 2006.
They are:
2006/1/13
2006/10/13

代码

/**
* @file source.cpp
* @author 黄杨波
* @date 2012-10-17
* @description
* 程序设计作业: 14. 黑色星期五
*/

#include<stdio.h>
int yiyueyihao (int year);
int runnian (int year);
int blackFriday (int year);

int blackMonth[12] = {};

int main()
{
	//freopen("simple.out","w",stdout);
	int day, month, year;
	int xingqi;
	int count;
	scanf("%d",&year);
	count = blackFriday (year);
	printf("%d\n",count);
	for(int n = 0; n < count; n++)
		printf("%d/13\n", blackMonth[n]);
	return 0;
}

int yiyueyihao (int year)
{
	int xingqi;
	int n, day = 1;
	for (n = 2; n <= year; n++)
	{
		if (runnian (n - 1))
			day = day + 366;
		else day = day + 365;
	}
	xingqi = day % 7;
	return xingqi;
} 

int runnian (int year)
{
	if (year % 400 == 0 || (year % 4 == 0 && year % 100 != 0))
		return 1;
	else return 0;
}

int blackFriday (int year)
{
	int month, day;
	int count = 0;
	day = yiyueyihao (year) + 12;
	for (month = 1; month <= 12; month++)
	{
		if ((month - 1 == 1)||(month - 1 == 3)||(month - 1 == 5)||(month - 1 == 7)||(month - 1 == 8)||(month - 1 == 10))
			day = day + 31;
		else if (month - 1 == 2)
			day = day + 28 + runnian(year);
		else if ((month - 1 == 4)||(month - 1 == 6)||(month - 1 == 9)||(month - 1 == 11)) 
			day = day + 30;
		if (day % 7 == 5)
		{
			blackMonth[count] = month;
			count++;
		}
	}
	return count;
}