Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated:
1
00:00:00,560 --> 00:00:02,330
Welcome back, ladies and gentlemen.
2
00:00:02,510 --> 00:00:06,010
My name is Vlad, and this is an Alphatech programming chorus.
3
00:00:06,470 --> 00:00:12,230
And in this challenge, you have to write a program that reads from the user three values and based
4
00:00:12,230 --> 00:00:13,670
on these three values.
5
00:00:13,910 --> 00:00:18,050
The program is going to find the maximum and the minimum between them.
6
00:00:18,290 --> 00:00:25,070
And although we've seen how that can be done just by using two variables and it wasn't so complicated,
7
00:00:25,070 --> 00:00:32,060
right now we are asked to find the maximum and the minimum between three variables, not just two,
8
00:00:32,180 --> 00:00:33,590
but three variables.
9
00:00:33,740 --> 00:00:40,280
So, for example, if we take a look at these three numbers, five, three and seven, I want that resolved.
10
00:00:40,280 --> 00:00:46,900
The output on the screen to be something like maximum was seven and minimum was three and one.
11
00:00:46,940 --> 00:00:48,400
These three numbers on.
12
00:00:48,430 --> 00:00:48,770
Right.
13
00:00:48,920 --> 00:00:54,770
And for another example, if we have the three numbers, two, five and one, then it's obvious that
14
00:00:54,770 --> 00:00:59,210
the maximum is going to be five in this case and a minimum is going to be one.
15
00:00:59,390 --> 00:01:05,270
So I hope the instructions are clear to you and that you have some idea of what pretty much you should
16
00:01:05,270 --> 00:01:07,040
do to solve that.
17
00:01:07,190 --> 00:01:12,740
And just the side note, you can't solve this challenge in a couple of ways and in a couple of different
18
00:01:12,740 --> 00:01:13,520
options.
19
00:01:13,940 --> 00:01:17,450
And although some of them may work eventually.
20
00:01:17,450 --> 00:01:17,840
Yes.
21
00:01:18,710 --> 00:01:23,030
I would like still to ask you to think of an optimized solution.
22
00:01:23,310 --> 00:01:23,720
All right.
23
00:01:24,050 --> 00:01:29,900
Meaning think of a solution to find meaning Moonman maximum and longer, these three numbers in the
24
00:01:29,900 --> 00:01:31,280
most efficient way.
25
00:01:31,670 --> 00:01:34,340
When you use as few conditions as possible.
26
00:01:34,640 --> 00:01:36,080
So bear that in mind.
27
00:01:36,230 --> 00:01:39,320
And I wish you good luck and I'll see you in the next video.
2542
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.