九度OJ学习笔记 题目1186

//方法一：需要预处理
#include<iostream>
#include<stdio.h> 
using namespace std;
#define ISYEAP(x) x%100!=0 && x%4==0||x%400==0 ?1:0
int dayofMonth[13][2]={0,0,31,31,28,29,31,31,30,30,31,31,30,30,31,31,31,31,30,30,31,31,30,30,31,31};
int buf[3001][13][31];
struct date{
	int year;
	int month;
	int day;
	int nextDay(){
		day++;
		if (day>dayofMonth[month][ISYEAP(year)]){
			day=1;
			month++;
			if(month>12){
				month=1;
				year++;
			}
		}
	}
};
int main(){
	date tmp;
	tmp.year=0;
	tmp.month=1;
	tmp.day=1;
	int cnt=1;
	while(tmp.year!=3001){
		buf[tmp.year][tmp.month][tmp.day]=cnt;
		tmp.nextDay();
		cnt++;
	}
	int n;
	int y;
	while(cin>>y>>n &&y<3001&&y>=0 &&n>=0 &&n<367){
		for(int i=1;i<13;i++){
			for(int j=1;j<dayofMonth[i][ISYEAP(y)]+1;j++){
				if(buf[y][i][j]-buf[y][1][1]+1==n){
					printf("%04d-%02d-%02d\n",y,i,j);
	                break;
				}
			}
		}
	}
	return 0;
}

注意：出现WA的两个原因

1. 题目要求日期格式为AAAA-BB-CC，位数不够用0补，故应用printf("%04d%02d%02d\n",y,m,d)

2. 别忘了\n！！！！要换行要换行要换行！！！！！

//方法2：n大于天数，就减去天数，直至到该月，该方法不需要预计算，占用内存小
#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define ISYEAR(x) x%4==0&&x%100!=00||x%400==0?1:0int dayOfMonth[13][2]={0,0,31,31,28,29,31,31,30,30,31,31,30,30,31,31,31,31,30,30,31,31,30,30,31,31};int
 buf[3001][13][32];int main(){int y,n,i;while(scanf("%d%d",&y,&n)!=EOF){for( i=0;n>dayOfMonth[i][ISYEAR(y)];i++){n-=dayOfMonth[i][ISYEAR(y)];}printf("%04d-%02d-%02d\n",y,i,n);}return 0;}