-
Notifications
You must be signed in to change notification settings - Fork 0
/
oj1186.cpp
74 lines (67 loc) · 1.05 KB
/
oj1186.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <stdio.h>
#define ISLEAP(x) x%100!=0&&x%4==0||x%400==0?1:0
int dayOfMonth[13][2]=
{
0,0,
31,31, //January
28,29, //February
31,31, //March
30,30, //April
31,31, //May
30,30, //June
31,31, //July
31,31, //August
30,30, //September
31,31, //October
30,30, //November
31,31, //December
};
struct Data{
int Year;
int Month;
int Day;
void nextDay()
{
Day++;
if(Day>dayOfMonth[Month][ISLEAP(Year)])
{
Day=1;
Month++;
}
if(Month>12)
{
Month=1;
Year++;
}
}
};
int buf[3001][13][32];
int main(){
int dayNum=0;
Data all;
all.Year=1;
all.Month=1;
all.Day=1;
while(all.Year!=3001)
{
buf[all.Year][all.Month][all.Day]=dayNum;
all.nextDay();
dayNum++;
}
int y,n;
while(scanf("%d %d",&y,&n)!=EOF&&n>0&&n<367)
{
int i=1;
int j=1;
for(i=1;i<13;i++)
{
for(j=1;j<=dayOfMonth[i][ISLEAP(y)];j++)
{
if(buf[y][i][j]-buf[y][1][1]+1==n)
goto print;
}
}
print:printf("%04d-%02d-%02d\n",y,i,j);
}
return 0;
}