Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated:
1
00:00:00,640 --> 00:00:08,530
Welcome, welcome, welcome, welcome, welcome to another exercise in our programming, programming,
2
00:00:08,530 --> 00:00:09,300
programming.
3
00:00:10,410 --> 00:00:15,940
Who this is another exercise in our programming course.
4
00:00:16,450 --> 00:00:24,760
And in this exercise, what you are requested to do is to write a program that receives a day, a month
5
00:00:24,910 --> 00:00:28,900
and the year, OK, simply receive some date.
6
00:00:29,590 --> 00:00:35,800
And the program should find and print the next day on the calendar.
7
00:00:36,580 --> 00:00:44,680
And I think that the task itself is not very complicated, at least not seems to be complicated when
8
00:00:44,680 --> 00:00:50,980
you can simply get like day, month and year and like do what will be the next day, then day plus plus.
9
00:00:50,980 --> 00:00:51,910
And that's it.
10
00:00:53,470 --> 00:00:56,710
Although this will work for most of the cases.
11
00:00:56,710 --> 00:01:05,410
But there are a couple of cases, a couple of cases where, you know, like the day may be the last
12
00:01:05,410 --> 00:01:12,730
day in the month and then you have to like to increment also the month and also the month may be like
13
00:01:12,730 --> 00:01:19,980
December and it should increment the year and finally the year, maybe also leap and leap year.
14
00:01:20,020 --> 00:01:20,320
Right.
15
00:01:20,330 --> 00:01:27,550
We talked about it in one of our previous exercises and we showed a full solution of what is a leap
16
00:01:27,550 --> 00:01:27,880
year.
17
00:01:28,510 --> 00:01:37,060
So, yeah, so that's something that we need to take into consideration and also to take into account
18
00:01:37,060 --> 00:01:43,930
what we should do if we have this option and this option and that option and how we should know if that's
19
00:01:43,930 --> 00:01:49,540
a leap year and we have 29 days or 28 days or whatsoever.
20
00:01:49,930 --> 00:01:52,270
So that's what you are requested to do.
21
00:01:52,270 --> 00:01:59,200
This exercise is kind of more difficult than it contains a lot of like, you know, small details that
22
00:01:59,200 --> 00:02:00,700
you need to pay attention to.
23
00:02:01,150 --> 00:02:02,620
But I believe in you.
24
00:02:02,620 --> 00:02:04,810
I think you will be all right with that.
25
00:02:04,810 --> 00:02:05,380
With that.
26
00:02:05,710 --> 00:02:07,630
So take your time.
27
00:02:07,630 --> 00:02:13,960
Think about the solution is not going to be easy and straightforward and basically before diving into
28
00:02:13,960 --> 00:02:22,690
code, what I want to show you is a couple of examples that maybe a little bit of useful for your solution.
29
00:02:23,630 --> 00:02:32,270
So the examples go like this, so if the current day is like this, give me this laser.
30
00:02:32,840 --> 00:02:39,410
So it's the 30 of October 2001, then the next day it's going to be 31.
31
00:02:39,410 --> 00:02:39,650
Right.
32
00:02:39,650 --> 00:02:44,130
Because we know that October has 31 days in this month.
33
00:02:44,960 --> 00:02:54,770
Next, we know that if, for example, we have 25 December 1998, then it will be 26 December 1998.
34
00:02:55,340 --> 00:02:56,660
And that's no problem.
35
00:02:56,660 --> 00:03:05,360
But if we still have year 28 of February 2020, then the next day is not going to be the first of marriage.
36
00:03:05,540 --> 00:03:10,130
But it will be 29 because it's a leap year.
37
00:03:10,160 --> 00:03:15,800
OK, so you need to check if a given year like 2020 is a leap year or not.
38
00:03:16,250 --> 00:03:20,710
And based on that result, do you like to print the next day?
39
00:03:21,170 --> 00:03:29,120
And finally, we also have like 28, 28, February 20, 19.
40
00:03:29,390 --> 00:03:36,070
Then the next day is going to be like because we know that the next day is it's not a leap year.
41
00:03:36,080 --> 00:03:41,440
So the next day is going to be also the next month, the first day of the next month.
42
00:03:42,110 --> 00:03:44,880
So that's basically, guys, what do you have to do?
43
00:03:44,900 --> 00:03:47,480
It's not so easy program.
44
00:03:47,480 --> 00:03:53,780
It has a lot of conditions, a lot of things that you need to take into account to like, you know,
45
00:03:53,780 --> 00:04:00,150
to like give full support, to write a full program, full working program, complete program that knows
46
00:04:00,170 --> 00:04:03,080
to get one day and to return the next day.
47
00:04:03,170 --> 00:04:12,710
OK, so you are is the future programmer need to take into account also all the small details and to
48
00:04:12,710 --> 00:04:14,940
treat every program like it should.
49
00:04:15,380 --> 00:04:17,710
So guys, I wish you good luck.
50
00:04:17,720 --> 00:04:18,650
You will need it.
51
00:04:18,650 --> 00:04:20,390
Give it a try, OK?
52
00:04:20,390 --> 00:04:21,820
Don't give up, ok?
53
00:04:22,220 --> 00:04:23,030
Don't give up.
54
00:04:23,030 --> 00:04:23,990
Give it some time.
55
00:04:23,990 --> 00:04:24,950
Give it some thought.
56
00:04:25,220 --> 00:04:30,740
Even if it if it will take you one hour or two hours to come up with a full solution.
57
00:04:31,220 --> 00:04:38,360
And only once you are done with that, feel free to move on and to check out the solution video.
58
00:04:38,780 --> 00:04:43,790
So my name is Lood, this is Alphatech and I will see you in the next video.
5702
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.