-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathNgayyy.cpp
195 lines (181 loc) · 2.97 KB
/
Ngayyy.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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include <stdio.h>
#include <math.h>
struct NGAY
{
int day;
int month;
int year;
};
void nhapNGAY(NGAY &dmy);
void xuatNGAY(NGAY dmy);
void xuat(NGAY dmy, int k);
int namNhuan(int year);
int soNgay_year(int year);
int soNgay_month(int month, int year);
int stt_thisYear(NGAY dmy);
double stt(NGAY dmy);
double khoangCach(NGAY dmy1, NGAY dmy2);
NGAY after(NGAY dmy, int k);
NGAY before(NGAY dmy, int k);
int main()
{
NGAY dmy1, dmy2;
nhapNGAY(dmy1);
nhapNGAY(dmy2);
int k;
scanf("%d",&k);
printf("\n");
xuat(dmy1,k);
printf("\n---------------------------------\n");
xuat(dmy2,k);
double k_cach=khoangCach(dmy1,dmy2);
printf("\n Khoang cach 2 ngay: %.0lf",fabs(k_cach));
if (k_cach>0)
printf("\n dmy2 --> dmy1");
else if (k_cach==0)
printf("\n dmy1==dmy2");
else printf("\n dmy1 --> dmy2");
}
void nhapNGAY(NGAY &dmy)
{
scanf("%d",&dmy.day);
scanf("%d",&dmy.month);
scanf("%d",&dmy.year);
}
void xuatNGAY(NGAY dmy)
{
printf("%d %d %d",dmy.day,dmy.month,dmy.year);
}
void xuat(NGAY dmy, int k)
{
xuatNGAY(dmy);
if (namNhuan(dmy.year))
printf("\n Nam NHUAN");
else printf("\n Khong nhuan");
printf("\n STT trong nam: %d",stt_thisYear(dmy));
printf("\n STT: %.0lf",stt(dmy));
printf("\n");
xuatNGAY(after(dmy,k));
printf("\n");
xuatNGAY(before(dmy,k));
}
int soNgay_year(int year)
{
if (namNhuan(year))
return 366;
return 365;
}
int namNhuan(int year)
{
if (year%400==0||(year%4==0&&year%100!=0))
return 1;
return 0;
}
int soNgay_month(int month, int year)
{
int m[13]={31,31,28,31,30,31,30,31,31,30,31,30,31};
if (namNhuan(year))
if (month==2) return 29;
return m[month];
}
int stt_thisYear(NGAY dmy)
{
int count=0;
for (int i=1;i<dmy.month;i++)
count+=soNgay_month(i,dmy.year);
return count+dmy.day;
}
double stt(NGAY dmy)
{
double count=0;
for (int i=1;i<dmy.year;i++)
count+=soNgay_year(i);
return count+stt_thisYear(dmy);
}
double khoangCach(NGAY dmy1, NGAY dmy2)
{
return (stt(dmy1)-stt(dmy2));
}
NGAY after(NGAY dmy, int k)
{
int tmp;
tmp=soNgay_year(dmy.year)-stt_thisYear(dmy);
if (k>tmp)
{
dmy.day=1;
dmy.month=1;
dmy.year++;
k=k-tmp-1;
}
else if (k==tmp)
{
dmy.day=31;
dmy.month=12;
k=0;
}
while (k>(tmp=soNgay_year(dmy.year)))
{
k-=tmp;
dmy.year++;
}
while (k>(tmp=soNgay_month(dmy.month,dmy.year)))
{
k-=tmp;
dmy.month++;
}
if (k>0)
{
tmp-=dmy.day;
if (k>tmp)
{
dmy.day=k-tmp;
dmy.month++;
if (dmy.month==13)
dmy.month=1;
}
else
dmy.day+=k;
}
return dmy;
}
NGAY before(NGAY dmy, int k)
{
int tmp;
tmp=stt_thisYear(dmy);
if (k>tmp)
{
dmy.day=31;
dmy.month=12;
dmy.year--;
k-=tmp;
}
else if (k==tmp)
{
dmy.day=1;
dmy.month=1;
k=0;
}
while (k>(tmp=soNgay_year(dmy.year-1)))
{
k-=tmp;
dmy.year--;
}
while (k>(tmp=soNgay_month(dmy.month-1,dmy.year)))
{
k-=tmp;
dmy.month--;
if (dmy.month==0)
dmy.month=12;
}
if (k>0)
{
if (k>=dmy.day)
{
dmy.month--;
dmy.day=soNgay_month(dmy.month,dmy.year)-k+dmy.day;
}
else
dmy.day-=k;
}
return dmy;
}