-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path19.c
94 lines (85 loc) · 2.05 KB
/
19.c
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/*************************************************************************
> File Name: 19.c
> Author: qusijun
> Mail: wiilen.lian@gamil.com
> Created Time: 2014年06月06日 星期五 20时32分27秒
************************************************************************/
#include<stdio.h>
#define LEAP 366
#define COMMON 365
int days_leap_year[] = {31,29,31,30,31,30,31,31,30,31,30,31};
int days_common_year[] = {31,28,31,30,31,30,31,31,30,31,30,31};
int result[1000];
int is_leap_year(int n)
{
if(n%4==0 && n%100 != 0 || n%400 == 0)
return 1;
return 0;
}
int allDays()
{
int sum = 0;
for(int i = 1900;i<2001;i++)
{
if(is_leap_year(i))
sum += LEAP;
else
sum += COMMON;
}
return sum;
}
int main(void)
{
//printf("%d",allDays());
int alldays = 0;
int index = 0;
for(int i = 1900;i<2001;i++)
{
if(is_leap_year(i))
{
printf("%d\n",1);
for(int j = 0;j<12;j++)
{
int days = days_leap_year[j];
for(int k = 0;k<days;k++)
{
alldays++;
if(k==0 && alldays%7 == 0)
{
result[index++] = alldays;
}
}
}
}
else
{
printf("%d\n",0);
for(int j = 0;j<12;j++)
{
int days = days_common_year[j];
for(int k = 0;k<days;k++)
{
alldays++;
if(k == 0 && alldays%7 ==0)
result[index++] = alldays;
}
}
}
}
int count = 0;
int len = sizeof(result)/sizeof(int);
for(int i = 0;i<len;i++)
{
if(result[i]>365)
count++;
}
printf("%d",count);
int leapyears = 0;
for(int i = 1900;i<2001;i++)
{
if(is_leap_year(i))
leapyears++;
}
//printf("%d",leapyears);
return 0;
}