USACO 1.1 Friday the Thirteenth

最新推荐文章于 2020-04-05 14:30:13 发布

tiutiu2011

最新推荐文章于 2020-04-05 14:30:13 发布

阅读量347

点赞数

本文链接：https://blog.csdn.net/tiutiu2011/article/details/48310839

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define DEBUG 0
#define TESTCASES 8

#define MONTHS 12
#define DAYS 7

int daysOfMonth[MONTHS + 1] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int daysOfDay[DAYS + 1];

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[11]= "inputx.txt";
		inputFileName[5] = '0' + (testCase - 0);
		freopen(inputFileName, "r", stdin);
		printf("#%d\n", testCase);
#endif

	int numOfYears;
	scanf("%d", &numOfYears);

	int day;
	for (day = 1; day <= DAYS; day++)
		daysOfDay[day] = 0;

	int days = 0;
	int years;
	for (years = 1; years <= numOfYears; years++){
		int year = 1900 + years - 1;

		if ( year % 400 == 0 || (year % 100 != 0 && year % 4 == 0) )
			daysOfMonth[2] = 29;
		else
			daysOfMonth[2] = 28;

		int month;
		for (month = 1; month <= MONTHS; month++){
			int day = (days + 13) % DAYS;
			if (day == 0)
				day = 7;
			daysOfDay[day]++;
			days += daysOfMonth[month];
		}
	}

	printf("%d %d ", daysOfDay[6], daysOfDay[7]);
	for (day = 1; day <= 5; day++)
		printf("%d%c", daysOfDay[day], day == 5 ? '\n' : ' ');

#if DEBUG
	}
#endif
	return 0;
}