background top icon
background center wave icon
background filled rhombus icon
background two lines icon
background stroke rhombus icon

Download "Занятие 4 (08.06.22) Java (основы) поток 32"

input logo icon
Video tags
|

Video tags

занятие
08.06.22
java
основы
поток
32
Subtitles
|

Subtitles

subtitles menu arrow
  • ruRussian
Download
00:00:01
and
00:00:27
so we will all start our homework, I don’t
00:00:31
sort it out, I don’t sort it out because we
00:00:34
will have the same thing to figure out on Friday
00:00:37
the fakes are next Monday and based on the
00:00:41
results of the voting on Monday,
00:00:44
we are studying only one person
00:00:45
voted that we are not studying,
00:00:51
we will all know that I will
00:01:04
explain to everyone why it is better, well, how would we
00:01:06
study in Monday because
00:01:08
when we miss studying once
00:01:11
a week we have such a property as to
00:01:12
forget a little, as if you
00:01:14
are remembered now everything is well, as if
00:01:17
in the subcortex, it’s not yet in memory, it’s
00:01:19
in the subcortex if we don’t
00:01:20
reinforce it twice a week it’s a
00:01:22
little forgotten, that’s why it’s better
00:01:25
to follow the steps, loved it, so
00:01:29
who planned Mondays too much,
00:01:31
yes we’re doing Monday, so
00:01:35
someone’s microphone turned on,
00:01:37
Alexey, the one you connected to the telegram, we ca
00:01:44
n’t understand the machine, I’ll repeat and today
00:01:47
the algorithm will be the most difficult lesson
00:01:50
on algorithms further there
00:01:52
will be practically no algorithms at the
00:01:55
moment, we still have to
00:01:56
go through today’s lesson sooner or later,
00:01:58
we still need to give it later,
00:02:01
so it’s better today let’s dsm-4
00:02:04
daddy do
00:02:07
what we will go through today we will go
00:02:11
through you can say cyclicity
00:02:14
within cyclicity this is sometimes it happens
00:02:16
that is, a cycle in a cycle when a
00:02:20
cycle in a cycle is used then when we have,
00:02:24
say, some kind of circle and within this
00:02:28
circle the same actions are repeated
00:02:30
and then this is repeated again, well, for
00:02:33
example, there
00:02:35
may be some kind of circle, suppose you
00:02:38
say I every day in the morning I get up and
00:02:41
squat 10 times, look, I every day, that
00:02:44
is, a warrior for 365 times there, that
00:02:47
is, this is a cycle for which they rotate 365 times,
00:02:51
and if you say every day they squat
00:02:54
10 times, then accordingly, within this
00:02:57
circle of cycles it will not be written above 10
00:03:00
squat once squat squat and you
00:03:03
also do an internal for loop that
00:03:05
does 10 squats and it turns out to be a
00:03:08
cycle in a cycle and there are a lot of such cycles in cycles
00:03:11
inside the world and today
00:03:14
our task is to fully train a
00:03:16
cycle in a cycle
00:03:19
create main 1 or just let’s mine
00:03:25
public static void main and the
00:03:30
first task that we will do is to
00:03:36
write a program that
00:03:40
will work for ten years if it is not
00:03:43
stopped and
00:03:49
the secret is if it is not stopped,
00:03:55
and
00:03:58
as soon as we install it it
00:04:01
will write to us exactly how much has passed from the start
00:04:05
years days
00:04:07
months weeks where I don’t know everything and so
00:04:10
on until and when we stop them
00:04:19
she will write to us
00:04:22
exactly the exact time how much was
00:04:25
calculated from the start like this we will write
00:04:30
how much has passed from the start and
00:04:36
if we leave the computer on for 10
00:04:40
years it will work for ten years
00:04:44
that is, look if the brothers are
00:04:47
10 years old
00:04:50
it means we have the first year and the second year and the
00:04:53
third year they are absolutely the same and the
00:04:55
fourth year are also the same, which means
00:04:57
we have a for loop that unscrews
00:05:01
in years and it starts from 0 to 10, that is,
00:05:06
we write a for loop and
00:05:10
for our convenience, we usually
00:05:13
call the variable here oh but in this time we
00:05:16
are going to the 7th year so that it is
00:05:19
already convenient for us int year is equal to zero we
00:05:25
start from 0 because initially 0
00:05:28
years have passed correctly since the start 0 no
00:05:30
so the intro is equal to zero and the
00:05:34
year is equal to zero while the year is less than
00:05:39
ten
00:05:41
year + +
00:05:45
and
00:05:47
now when we are inside the body of the
00:05:51
for the loop, we mean that this
00:05:55
body must work for 1 year
00:05:59
and there will be ten such circles, let it be 10 years,
00:06:03
which means inside the body we must write
00:06:06
write a piece of code that works for
00:06:08
one year, what is inside one year, that is,
00:06:11
we need to determine
00:06:13
next we will count days or
00:06:15
months, let us count from
00:06:18
1 to 3 165 days, but then we will
00:06:21
the program writes that 0 days have passed since the start, or
00:06:24
rather 0 years, there are
00:06:27
25 days or there are one hundred and forty-three days until
00:06:30
it will be unclear how many months, let’s
00:06:32
all -we will also count a month, that
00:06:35
is, within a year of any absolute year
00:06:37
there are 12 months of work, so here we
00:06:41
write an internal for loop from 0
00:06:45
to 12 and call it mans
00:06:52
mans equals zero on the command less than 12
00:06:59
+ +
00:07:06
inside this for loop we need to
00:07:10
write a piece of code that
00:07:11
works out a month, of course, there
00:07:14
are different months and 28 days from 30 to 31,
00:07:17
but let’s not get hung up on that,
00:07:20
yes, we could write, let’s say a
00:07:22
check what exactly this month is, but we wo
00:07:25
n’t write that, we’ll write it
00:07:26
means that every month has 30 days
00:07:29
and then let’s write like this and
00:07:36
yes and equals zero
00:07:40
as long as the day is less than thirty
00:07:44
to i + + and pay attention I always
00:07:49
stand inside inside inside I don’t go beyond the
00:07:51
limits or the case of the for loop, that is, everything is
00:07:54
inside and
00:08:00
now here you can write something that will
00:08:03
work out one day, respectively 24
00:08:06
hours here is already simpler inner loop for
00:08:17
I forgot how to write
00:08:28
from and to zero while the hour is less than 24
00:08:33
hours + +
00:08:42
now what will happen relative to one
00:08:45
hour 1 hour we turn in minutes
00:08:53
mind zero by fireplace less than 60
00:08:57
minutes plus plus and
00:09:01
in the last inner loop we will now
00:09:04
unscrew what relates to 1 1 minutes is
00:09:07
60 seconds
00:09:09
it is
00:09:12
equal to zero so acer is
00:09:18
less than 60
00:09:28
all + + and
00:09:35
here from this curly brackets give
00:09:39
curly brackets should ultimately pass
00:09:42
one second
00:09:44
how to make a year pass one
00:09:49
second that is The first thing we can
00:09:51
do is display a message that
00:09:54
how many years have passed since the start so many
00:09:56
months so many days and so on how to
00:09:59
display this, that is, we can make a
00:10:01
system from printer and and
00:10:04
suppose we do here a
00:10:07
plus has passed since the start and insert it there a variable,
00:10:09
but there is also another way, another
00:10:13
way, this is what systems of systems are, this is
00:10:16
our computer, what is out out this is our
00:10:19
console,
00:10:21
our console has certain methods
00:10:24
when we put a point here is a set of methods
00:10:27
also a set of methods like the string
00:10:30
out type, this is also a
00:10:32
certain object like there is a method
00:10:34
print l.n. we called one of them what is the
00:10:37
print and print method l.n. This is a
00:10:40
print with a transition to the next page
00:10:43
l.n. to the next line l.n. this
00:10:45
means that go to the next
00:10:47
line for the next output. The print method
00:10:50
is printing without moving to the next
00:10:54
line. All that will be output
00:10:57
will be displayed inside one long
00:10:59
line and there is also a print ef ef this is
00:11:03
formatted output, now you
00:11:05
will take the print ef from formatted
00:11:07
conclusion
00:11:09
when we see that several methods, here is the
00:11:12
print ef method and here is the print ef method,
00:11:14
it happens that the method has the
00:11:16
same name, but in fact,
00:11:19
different input parameters are different
00:11:22
methods and depending on what you
00:11:25
put inside the parentheses, this
00:11:27
method will be called from Odessa here in
00:11:31
parentheses you give more then
00:11:32
this print method will be called and if you
00:11:35
give chart this one will be called and it itself
00:11:38
dynamically adjusts from what
00:11:41
you give as input parameters now, by
00:11:43
and large, we will call
00:11:45
this method which will give string a
00:11:48
text string and objects for output, but
00:11:51
if we accidentally select this one,
00:11:53
it’s also okay because it is
00:11:56
dynamically built from the input
00:11:58
parameters for suppose I even select
00:11:59
this one as special and now I give it
00:12:02
anyway, here it shows that I should
00:12:04
supposedly give such an object, but I’m giving
00:12:06
it away the variable
00:12:09
is what I want to display and it has already taken another
00:12:13
different method, it has been rebuilt and
00:12:17
here in double quotes I give this
00:12:20
line that I want to display, let’s assume
00:12:23
this has passed since the start: for example, 1 year
00:12:30
2 months
00:12:33
23 days
00:12:37
12 hours
00:12:40
34 minutes
00:12:42
14 seconds,
00:12:45
that is, we we wrote the entire line that
00:12:48
we want to be displayed;
00:12:54
the printer has no similarity to the transition to the
00:12:58
next line, so the next
00:13:00
line and the next next one will be
00:13:02
displayed in 1 day estrogen, so
00:13:04
that this does not happen here at the end after
00:13:07
14 seconds we put clash n slash m this is the
00:13:11
transition on the next line there is a slash n
00:13:16
like this, that is, we are inside
00:13:20
double quotes and we will write dreams there will be a
00:13:24
transition to the next line and
00:13:26
now since this is formatted
00:13:28
output it is now allowed to insert
00:13:31
variables inside a text variable and
00:13:34
with variables we want to substitute this
00:13:36
value because not a single year and
00:13:38
as much as I can open now I’ve unscrewed
00:13:41
this for loop here, substitute the
00:13:43
variable year instead of two, I want to
00:13:46
substitute the variable man’s instead of 20
00:13:49
days before and the variable and so on, that is,
00:13:53
I ultimately want to substitute one two three 4
00:13:56
5 six variables,
00:13:58
how do I denote the variable I instead for
00:14:02
this unit I put the percentage icon
00:14:05
first, the percentage, and this goes to the
00:14:08
variable designation, which means percentage, and suppose
00:14:12
dnd this number d comes from de simone
00:14:17
number, that is, I indicated that a
00:14:20
number will be inserted here since I have a year in
00:14:23
the number, then here I also put the
00:14:27
percentage icon on d
00:14:28
since a number will also be inserted and,
00:14:31
accordingly, instead of 23 there will also be a
00:14:34
percent sign and, instead of 12, instead of 34 and 14,
00:14:40
that is, thus one two three 4 5
00:14:43
six percent sign dema
00:14:46
if we had a non-numeric format,
00:14:50
then instead of the letter d there would be some kind -that’s
00:14:53
another letter and this letter would have to be
00:14:55
looked up on the Internet,
00:14:56
let’s assume if the text is a letter with a letter, but
00:15:00
in our case we have all the letters d m and
00:15:05
now after this variable,
00:15:08
being inside
00:15:10
the body of the methods
00:15:13
here, I must now
00:15:16
put six variables through the western one that will
00:15:20
these values ​​are substituted
00:15:23
1 I represent accordingly here,
00:15:27
then month
00:15:31
,
00:15:33
then from to day
00:15:38
now
00:15:41
minutes and
00:15:43
seconds,
00:15:54
the main thing is that the number of these
00:15:57
coincides with the quantity of these
00:16:00
your order in your order clearly it
00:16:04
will be substituted this is the first here it is the
00:16:06
first this 2 here 2 of course
00:16:14
we finished writing and now if we run
00:16:18
if we run
00:16:25
[music]
00:16:31
if we run then we very quickly
00:16:34
went into the console a lot of things to write
00:16:37
articles can’t be written in minutes and now I’ll
00:16:41
look
00:16:42
[music]
00:16:46
what I do twice man’s
00:16:55
look if we run then say that
00:16:58
it works in in real time
00:17:00
it’s impossible to say because he will start
00:17:03
counting down very quickly from me
00:17:06
three minutes went 710 1834 already that’s how many
00:17:09
minutes but for what we see he’s
00:17:12
counting the circles correctly 6 7 8 9 10 he’s
00:17:16
counting correctly but only the dough is the
00:17:18
moment that’s counting down very quickly and
00:17:21
just like we see that when the seconds are over, let’s
00:17:23
say the seconds turn into seconds,
00:17:26
60 laps go, then
00:17:29
the seconds actually start again again, but the minute
00:17:34
has increased, the counter itself is correct,
00:17:37
only incorrect, real-
00:17:38
time mode, how to add real-time mode,
00:17:42
we need this piece of code,
00:17:46
this one it passed the circle in exactly one
00:17:49
second and accordingly we need to
00:17:52
make sure that the thread that
00:17:54
performs this move is because
00:17:57
someone is actually executing this code, this is a thread and
00:18:00
we need to stop this thread for one
00:18:04
second, that is, it has executed quickly
00:18:06
printed on the console now we say
00:18:08
wait a second in that further I typed and
00:18:10
again we say wait a second, that is, we
00:18:13
will slow it down and every second it
00:18:16
slows down to sleep for one second exactly
00:18:18
let us work with threads in general, we
00:18:22
will have about the nineteenth lesson,
00:18:24
but now we’ll just see how to
00:18:27
put the thread to sleep for one second, we
00:18:31
turn to the file called environment
00:18:34
this file turned
00:18:37
out there
00:18:39
we turn to the roller called
00:18:42
environment this file it controls the flows
00:18:48
when Sally again the import site
00:18:51
no light came up from above
00:18:55
this is a link consider that to the flow
00:18:58
that executes your code and here
00:19:00
I have this method called blind people, that
00:19:03
is, to fall asleep, and here we can indicate
00:19:05
the number of milliseconds, how many we want
00:19:07
ours to sleep then and indicate a thousand
00:19:12
further, the piece of code swears, but the fact that it
00:19:16
swears, we will consider this topic
00:19:18
in about the sixteenth lesson, that is,
00:19:20
now how to fix it, I’m just
00:19:23
saying but I won’t say
00:19:25
exactly what happens
00:19:28
when we see that it’s swearing in red, we
00:19:32
stand on the words slide and a light
00:19:35
bulb like this appears, if we
00:19:37
click on the light bulb there are two options for
00:19:39
solving the problem, let’s all choose 1 1
00:19:44
this will be it takes a action in method
00:19:46
signature
00:19:48
it’s on in fact, I added just such
00:19:51
a cap, but this cap allowed you not to
00:19:54
swear, your move turned out,
00:19:59
that is, once again a piece of code that
00:20:02
connects the flow,
00:20:07
you wrote it like this right away, big
00:20:10
lips
00:20:11
slip called again mills, don’t write to me in
00:20:16
any case, it was inserted itself called
00:20:19
this is the method. snow and inserted here into a
00:20:23
thousand,
00:20:24
now the move began to swear, they called out to him, they moved away, a
00:20:29
light bulb was generated, they clicked on the light bulb and chose
00:20:32
the option to add an exception in the method and
00:20:36
you had this little thing registered that
00:20:38
made it possible not to swear at this move,
00:20:41
but we are not discussing this topic yet, but
00:20:44
this puts the thread to sleep for 1 second, now
00:20:47
when we start it will happen in
00:20:49
real time mode,
00:20:54
that is, we see the program went
00:20:56
slowly and it really counts
00:20:59
the seconds correctly, absolutely correctly, and
00:21:02
if you don’t stop it, it will
00:21:05
work in the end for 10 years
00:21:10
[music]
00:21:18
this is real time mode because what
00:21:21
you indicated is blind.
00:21:24
1001
00:21:25
seconds,
00:21:31
well, this is the task that I’m looking at,
00:21:35
which it won’t write the exact time,
00:21:37
how much has passed the horde, it means it’s just
00:21:40
such a task to write the real time,
00:21:42
how much has passed from the start, how it
00:21:44
works, I’ll figure it out
00:21:48
when we
00:21:49
work, it’s something like this, the
00:21:52
cycle year is equal to zero 0
00:21:56
less than ten before you need to scroll the body
00:21:59
here this is the monty cycle
00:22:01
less than zero man's 000 less than twelve
00:22:05
to and here again the themes are found again the
00:22:08
cycle for
00:22:10
100 less than thirty to again the cycle hour by
00:22:14
hour less than twenty-four to minute 0
00:22:17
minutes from 60 to second new second
00:22:20
less than 60 to works out the bodies here,
00:22:23
just work out the bodies and he writes from the
00:22:25
start 00000 has passed, she substitutes
00:22:28
because these variables are really 0
00:22:30
fall asleep for one second and the next
00:22:34
sects + + and he first works out
00:22:37
this inner loop for twist twists
00:22:40
twists against up to 60 as soon as he
00:22:43
has finished twisting 60 60 less than 60 no it
00:22:48
turns out we have reached the end of the body of the cycle
00:22:50
background means a minute plus plus we are
00:22:53
back here a minute less than 60 before again
00:22:57
we need to perform the inner loop and the background will
00:22:59
again pass 60 circles only in
00:23:02
relation to minute one when minute
00:23:05
one has reached the end 60 circles have reached
00:23:07
the minute became 22 less than 60 to and again
00:23:11
the hands went, that is, he doesn’t even get out
00:23:15
of this circle when he gets from here to here
00:23:17
to an hour plus plus he gets there only
00:23:20
in an hour, respectively, so we see
00:23:24
that he’s spinning absolutely correctly, the meaning is
00:23:26
clear,
00:23:27
great, I’m stopping the program
00:23:30
is all and
00:23:31
now we’ll remove the simulator check on
00:23:34
which we will roll back the cycle since
00:23:36
it is used often
00:23:39
on which in the simulator we will
00:23:42
roll it back on this one now I’ll show you we
00:23:56
taught you arrays in the last lesson we
00:24:02
taught arrays like this this
00:24:05
was the array and
00:24:09
everyone
00:24:11
each one turns out that each cell was
00:24:13
signed like this on top in Yandex, but this is
00:24:17
not the only array format,
00:24:20
there are
00:24:21
also an array like this, this is called a
00:24:26
2-dimensional array, and
00:24:27
in a two-dimensional array, this is this, this is the
00:24:31
column indices, this is the column, this is the 3 4 5
00:24:36
column, this is this will be Yandex
00:24:40
rows
00:24:41
row indices also start from 0
00:24:45
here Yandex islands came here
00:24:48
row indices are considered a little
00:24:51
more important than column indices and they are
00:24:54
primary why because in
00:24:58
fact this is a 2-dimensional array this
00:25:00
is actually a one-dimensional
00:25:03
array like this this supposedly goes to the ground
00:25:07
floor first floor 2 3 4 let's
00:25:11
count like this 4 and on the ground floor
00:25:14
I have it under the candle let's assume earlier
00:25:17
on the ground floor there is this
00:25:19
one-dimensional array here this one-dimensional
00:25:22
array and it turns out that inside this
00:25:24
cell there is a whole array here and
00:25:28
inside this cell lies this whole
00:25:32
array,
00:25:33
and inside this cell, accordingly,
00:25:37
this whole array can lie, and this
00:25:40
array, purely theoretically, I deliberately
00:25:41
went beyond the limits, it can be larger
00:25:44
than this one, why not, and inside
00:25:48
this one, accordingly, let’s
00:25:50
assume this array too it
00:25:53
can be smaller, I removed all these cells, there are
00:26:00
no borders now,
00:26:03
that is, like this, and
00:26:06
accordingly, each floor has its own
00:26:10
passive, so these row indexes,
00:26:15
these ones, are primary, more important than
00:26:18
these, but usually, of course, two-dimensional
00:26:21
arrays, they are, well, even, they are
00:26:25
we mean that with the same
00:26:27
number of rows, the same number of
00:26:28
columns, not not with different but with different ones,
00:26:32
they can be just straight away, I’m talking with different ones,
00:26:34
they can be if we want to
00:26:38
put some data here on this cell on
00:26:40
this one, then we need to know its indices
00:26:43
row indices and the column indexes
00:26:46
turn out to be 23 in Yandex, where it is
00:26:50
used, let’s see where it is
00:26:52
used with them, we render the
00:27:00
game tic-tac-toe
00:27:02
in pictures, we see what we see
00:27:05
here is a 2-dimensional array in which
00:27:07
some kind of data is filled in, and somewhere
00:27:10
you can become somewhere- then no, don’t become a
00:27:12
game, let’s assume a minesweeper, too, who knows
00:27:17
who played whom windows, this is also a
00:27:20
2-dimensional array in which there are
00:27:23
bombs somewhere, where they could be,
00:27:27
it could also be a chessboard on
00:27:30
which they can play correctly, this is later, a
00:27:33
2-dimensional array this it could be a sea
00:27:36
battle, it could be
00:27:39
mathematical matrices and so on, that is, this is
00:27:41
what is required in the form of
00:27:45
structures like this, it cannot be saved until it is
00:27:48
used, there are many places where it is used, you and I
00:27:50
will also use it and
00:27:53
if we need to use it, let’s
00:27:56
then create it and do it let's create the first task, let's
00:27:59
assume it's in a two-dimensional
00:28:01
array, empty empty, let's assume and
00:28:04
indicate that intel will be stored there, if
00:28:07
we indicate that intel will be stored, then
00:28:10
they will automatically
00:28:11
let the very points be filled with zeros,
00:28:14
if we indicate that intel will be stored here,
00:28:18
then we will have all zeros and
00:28:21
each cell filled with zeros, we
00:28:24
will try to simply output
00:28:27
our entire array at the end, that is, this is how we will
00:28:28
initially create it and print
00:28:31
here such a task, create main one
00:28:39
public static void main
00:28:48
how to catch you fps, we indicate the type int,
00:28:52
then single and double
00:28:56
and
00:28:57
parentheses By the way, I can run right away and
00:29:00
type in there is also such a thing as a
00:29:03
three-dimensional array, here’s a three-dimensional
00:29:06
array, let’s assume that Rubik escaped when there
00:29:09
is a coordinate x y and z sorento, that is, a
00:29:13
three-dimensional array is when x y z yes, here is a
00:29:16
Rubik’s cube, these are examples when there is
00:29:17
a volume but we don’t have a volume, let’s do it for now
00:29:20
two-dimensional of all, this is what we will call
00:29:24
it, suppose the numbers
00:29:27
will be equal and
00:29:30
we can again have two options,
00:29:32
or immediately fill it with some
00:29:36
information,
00:29:37
this is the first option and the second option is
00:29:41
if we do not specify anything, that is, we
00:29:43
will create it empty and then it will be created with
00:29:45
zeros we are just being taught the
00:29:47
option of zeros, respectively, we
00:29:49
create using the word new also
00:29:52
new in is stupid with its icon of a two-dimensional
00:29:55
array and in the first corners we need to
00:29:58
indicate the number of rows in the second the
00:30:02
number of columns, well, let’s assume
00:30:05
the number of rows we want is 3 and the number of
00:30:08
columns is 4 3 by 4 and
00:30:14
now let's try now
00:30:19
let's try to output each cell to the console,
00:30:22
taking into account that if we didn't know the
00:30:25
for loop we didn't know, it turns out we
00:30:29
output it first, that is, we have three by four
00:30:32
days, three lines like this by 4, that
00:30:37
is, we have something like this if we
00:30:41
didn’t know the cycle, the form would first be knocked out,
00:30:43
displayed in Yandex 00 then 01 02 and 03
00:30:50
seconds it will restart, it
00:31:27
turns out that you are making him racist from
00:31:30
pretend, let’s
00:31:45
just use a little print
00:32:00
here to bring the cell up at index
00:32:05
00,
00:32:09
we have a pier at index 00, that is, we got
00:32:12
this one 00 further we want
00:32:17
01 it turns out 1 primary lines 01
00:32:21
accordingly we do
00:32:22
copy paste below 01
00:32:27
only important point we want the
00:32:30
output to continue on the same
00:32:33
line correctly so we must
00:32:36
delete mm and just call the print method
00:32:39
which will leave the next cell on the
00:32:42
same line if the sprint is also and also so that
00:32:46
the numbers are not in the drain, I
00:32:50
would also add a plus in double quotes after the output of one number,
00:32:54
a space just so
00:32:56
that there is access
00:32:58
here, it turns out that we will also
00:33:01
copy and indent and
00:33:05
now, accordingly, I will copy this line and paste it
00:33:09
here it turns out there are
00:33:13
four cells inside one line with
00:33:17
index 0 1 2 3, respectively, here
00:33:19
I change
00:33:21
0123 that is, this is how we will output the first
00:33:24
stack
00:33:26
after the first line, we need to move to the
00:33:30
next line, respectively, here we
00:33:32
can already make
00:33:34
systems from print l.n. and
00:33:38
don’t put anything inside it so that there is a
00:33:40
transition to a new line and
00:33:42
then repeat this line again,
00:33:46
just change the indices here,
00:33:48
make the indices already one because there
00:33:51
will no longer be a zero line, not this
00:33:54
line, but this line in it in in the columns the
00:33:57
indexes are the same, but in the row they change and
00:34:00
the unit is compiled, so I copy,
00:34:03
even I would say copy all these
00:34:05
lines,
00:34:08
paste them below and here I change the index to
00:34:14
1111, that is, the first row to the left is cell
00:34:17
1 1 1 2 1 3 and
00:34:21
since we have three rows then,
00:34:24
accordingly, I will also need to
00:34:26
copy and paste below for the third line
00:34:28
and change the indexes here
00:34:31
accordingly to 2 2 2 2 2 it turns out
00:34:36
that these are the indexes of this second line
00:34:38
20 21 22 23
00:34:42
output 20 21 22 23
00:34:45
now I’ll run it to see the result,
00:34:59
that makes
00:35:05
sense so far I understand the correct one hello
00:35:08
great and now the question becomes,
00:35:11
of course, how to shorten it because
00:35:14
it’s wrong
00:35:17
to write everything down completely manually because if it’s 100 by
00:35:21
100 there will be a lot of
00:35:23
whole lines, you now have other things,
00:35:25
how to shorten it, so we have to look at
00:35:28
the chronology if we actually take
00:35:31
any one let's say this line in
00:35:35
this line 1 is exactly the same and so this
00:35:37
line only two numbers are changed
00:35:41
this line is relative to this line
00:35:43
two numbers are also changed in it,
00:35:47
respectively, we need to generate two numbers with
00:35:49
some kind of
00:35:52
first number, pay attention
00:35:55
this is the first number all 0000 and here
00:36:00
1111 here 2 2 2 2
00:36:04
accordingly we draw the conclusion that we
00:36:07
can, purely theoretically, write a for loop
00:36:09
that asks for this piece of code 0
00:36:13
1 2 3 times
00:36:17
they rotate my variable and here
00:36:20
we substitute it here and it turns out it’s quite a departure
00:36:23
01 come on let's do this 8 below
00:36:28
we put written down the forms in round brackets of the topic
00:36:33
and i equals to hacking while they are less than
00:36:39
three in our case because we want to
00:36:42
generate
00:36:43
012 and plus plus and
00:36:53
here in the body we inserted you just the
00:36:57
whole one piece, this is how I put it from here
00:37:01
I’ll copy
00:37:02
and paste here and
00:37:05
I already said before that
00:37:10
I will change this two to and here
00:37:14
and here and here and here it turns out it will be
00:37:21
equal to zero while a and less than all
00:37:24
while a and less than three turns out and less than
00:37:28
three until we scroll through this one piece and
00:37:31
substitute 0000 here, that is, it will be
00:37:34
displayed, in fact, this is
00:37:37
next, oh, it will increase by 1 1 less than 3 until the
00:37:41
whole circle
00:37:44
1111 will spin here and
00:37:47
this piece will be substituted here, we will work further, oh,
00:37:50
it becomes 2 2 less than 3, and the pike perch
00:37:54
was put 2222 worked out,
00:37:57
agree
00:38:00
for now, yes, because we need it, and now
00:38:05
we understand that we
00:38:07
made one piece out of these three pieces, but now we
00:38:10
see how else we can shorten it, that
00:38:13
is, we take this one line and
00:38:14
understand that this line differs from
00:38:17
this one by the number, look
00:38:20
Another number is spinning, that is, in
00:38:22
fact, we spin this line
00:38:24
four times and it changes
00:38:27
0123,
00:38:29
respectively, being here inside we
00:38:32
can loop it four times,
00:38:34
comfo will start four times, yes,
00:38:37
why not, that is, here I will write
00:38:39
a loop for which turns 0123 these
00:38:44
numbers are 0 1 2 3 here it will be inside
00:38:49
because we need this piece of code
00:38:51
inside and
00:38:53
since a and the variables are already occupied, the
00:38:56
next internal variable
00:38:58
is called j, usually int j is equal to
00:39:02
zero
00:39:03
while j is less than 4, they saw it, it is
00:39:09
less than four and here less than 4 we are here
00:39:11
and here business
00:39:14
4j + + and
00:39:17
here we insert this one line here
00:39:22
this one line and
00:39:24
change the 2 to the variable j it
00:39:27
turns out j is less than 0 for
00:39:30
j 0 0 less than four before printing to the
00:39:35
console
00:39:36
00 suppose j + + j
00:39:41
1 less than four to prints to the console
00:39:44
01 j becomes 2 2 less than 4 to
00:39:49
is printed to the console, respectively, already
00:39:52
02 and 03
00:39:55
that is, this will be an analogue of
00:39:56
this this this this and this line
00:39:59
when it reaches us, of course,
00:40:02
now we need to do this but we are
00:40:05
not behind the chain one because it
00:40:07
stands on its own and I just insert it after the
00:40:11
for loop and now this piece of code is
00:40:14
replaced by this usb am code and
00:40:17
this piece is where I delete it from here, I
00:40:19
just even take it and delete it and it turns out
00:40:22
We have such a laconic, beautiful
00:40:25
cycle in a cycle, a cycle in a cycle, this is a
00:40:28
pass through,
00:40:30
well, it turns out that it’s like our square
00:40:33
or rectangular two-dimensional arrays,
00:40:36
and now I’ll comment out this in general,
00:40:42
I’ll comment on everything and now I take it and run it,
00:40:48
check whether it’s working correctly, it’s
00:40:56
working absolutely correctly We
00:40:58
correctly replaced the only point
00:41:01
that we also wanted to replace this
00:41:04
C and this four because
00:41:06
we sewed them and the C is
00:41:10
actually a reference to the number of lines because
00:41:12
we have three lines and
00:41:15
the C is inserted here a4 is the number of columns 404
00:41:20
columns according to us they need to be
00:41:22
replaced instead of C to find out the
00:41:26
number of lines and the numbers .
00:41:29
linux this will be the number of lines and
00:41:33
how to find out the columns and the columns
00:41:37
we need to take a link to the current
00:41:41
line that is this is the whole floor
00:41:43
which has indications of the quantity
00:41:46
quantity we need to take the whole floor and
00:41:49
find out its length the whole floor or or
00:41:52
this this is a reference to everything floor and
00:41:56
the numbers by index, let's assume 0, so
00:42:00
we once indicated the square corners,
00:42:04
this means accessing the entire floor, the
00:42:06
entire row,
00:42:07
but by indicating but we are addressing the 0th
00:42:11
line, indicating one, we are accessing the first
00:42:15
line, and here we need to substitute a and
00:42:17
because just the same and oh, he spins the
00:42:20
floor indexes and gets numbers by
00:42:24
index.
00:42:25
links length this will be the number of
00:42:28
columns this syntax just
00:42:31
needs to be understood and remembered once
00:42:34
and
00:42:36
now I’ll run it again, that is, we have
00:42:39
such a passage that
00:42:41
will be frequent, that
00:42:46
is, we see that nothing
00:42:48
was supposed and
00:42:52
we draw conclusions that oh generates
00:42:57
row indexes ajay generates
00:43:00
column indexes al arrows jake column
00:43:05
everyone got it
00:43:08
[music]
00:43:15
no not everyone got it
00:43:19
[music]
00:43:24
I got zeros
00:43:27
[music]
00:43:33
[music]
00:43:37
everyone got it you guys
00:43:40
got it so well
00:43:42
play those who lure you also
00:43:44
do it in parallel, you also
00:43:46
succeed if you just have questions,
00:43:48
as it were, usually the group is more active in the
00:43:50
sense that those who are online can
00:43:51
turn on the microphone and at any time
00:43:52
ask some questions
00:43:55
or screenshots and show yours as they learn
00:43:57
to throw, I can analyze them
00:44:04
or at least write to the chat if there is
00:44:08
such an opportunity okay guys let's move on
00:44:11
yes everyone is ok here you guys
00:44:13
too when
00:44:15
[music]
00:44:28
[music]
00:44:51
[music]
00:45:02
[music]
00:45:21
[music]
00:45:22
just also did good let's study through
00:45:26
without
00:45:27
them
00:45:33
see you later
00:45:35
let's move on further in general general carefully
00:45:40
so we do my next ones on the
00:45:43
next day of war 2 and
00:45:52
public static void main you can slightly
00:45:55
window the period to the number of places
00:45:57
opportunities want to darna
00:45:59
thank you
00:46:08
let's now try
00:46:13
to do such a moment the
00:46:16
task will be more difficult right away, I say, but
00:46:20
nevertheless we will now trying
00:46:22
to make it
00:46:32
will be in this format,
00:46:36
well, suppose we have
00:46:39
eight by eight
00:46:48
eight by eight and
00:46:56
our task is to
00:46:58
let it all be filled with zeros,
00:47:01
okay, no problem, but our task is to output
00:47:05
to the console
00:47:07
all these are zeros, but output to the console
00:47:12
where in this format now you I’ll show you
00:47:15
simply
00:47:18
to in a checkerboard pattern
00:47:21
like this and,
00:47:26
accordingly, where the zero falls on the
00:47:29
yellow one, let’s assume we’ll display a zero, and
00:47:31
where the zero falls on the green one, we’ll
00:47:35
output a unit,
00:47:41
let’s assume this is
00:47:51
how to do it, well, let’s, in principle,
00:47:54
it will be clear that where I won’t
00:47:57
confuse with ones I wanted like
00:48:00
this, the task would be to display it like this on the console
00:48:03
only where the green one would be
00:48:05
displayed, let’s assume a zero, and where
00:48:07
the yellow one would output St.
00:48:10
how to do this that is, let's do this, we
00:48:13
have it anyway, we need a 2-dimensional
00:48:17
array to create phone 7 by 8 and
00:48:19
initially say that it is filled with
00:48:22
zeros here we create a 2-dimensional array and the
00:48:27
icon of a two-dimensional array
00:48:31
can also be called Ivan you
00:48:36
will change the new
00:48:40
icon of a two-dimensional and to the icon of a
00:48:42
two-dimensional array 8 by 8
00:48:48
[music]
00:48:56
and
00:48:59
then
00:49:01
we, accordingly, what we think, we need to
00:49:05
print each cell one hundred percent of
00:49:08
each, that is, we will have the generation of
00:49:10
all indexes, we will generate the unique generation of
00:49:13
all indexes only depending on
00:49:16
some specific conditions, we print
00:49:18
either like this or like this, that is, it is
00:49:20
already or or will be written inside us, but the
00:49:24
passage goes through all the indexes, if the passage
00:49:28
through all the indexes is definitely
00:49:30
such a cycle inside such a cycle, this is the
00:49:33
generation of indexes oh this is the generation of the
00:49:35
index arzhey this is one hundred percent and there is no way without it
00:49:38
so I immediately make a for loop, the
00:49:42
first for loop will generate
00:49:45
row indexes, it turns out int i is equal to
00:49:49
but two while a and less per
00:49:55
pier. minus and plus plus this is
00:50:01
the generation of lines and these circles and this is an
00:50:04
analogue of the same thing as if we were
00:50:06
walking like this
00:50:09
once, once, once,
00:50:11
line by line,
00:50:12
we walk line by line and it will
00:50:16
accordingly make eight circles,
00:50:20
then we stand inside and
00:50:23
write a cycle background that generates
00:50:27
row indexes, that is, we would brightly stand
00:50:29
on this line and now I generate
00:50:31
one two three four five six seven with my
00:50:32
next mouth again 0 1 2 3 4 5 6 7
00:50:36
that is, we generate
00:50:37
column indexes in parentheses the body
00:50:44
here goes find j equals zero
00:50:50
while j is less, here you
00:50:53
just need to remember the same formulation of
00:50:55
numbers by index and . winx she
00:50:59
always comes here such a lamp by index oh that
00:51:02
is the current line yu. links
00:51:07
j + +
00:51:15
after the inner loop, background, in any
00:51:19
case, we will have a transition to a new
00:51:21
line and it will be here, that is,
00:51:24
when we have completed the inner loop, we
00:51:26
have a printer system and
00:51:32
inside we print either this way or that,
00:51:37
depending on the condition, that is we need to
00:51:41
put either this or this
00:51:45
or this or this we will have this condition
00:51:49
if and else and here I immediately write their
00:51:54
parentheses of the body and
00:51:57
be sure to write lc and body after the body
00:52:11
and
00:52:15
inside this condition
00:52:21
I print to the console just take system
00:52:24
and print I print to the console,
00:52:27
let’s assume 0 space, and
00:52:31
in this case I print one space to the console,
00:52:36
that is, we either print zero space
00:52:40
or print one space, or we
00:52:42
did a warm-up and
00:52:45
note that the system from print
00:52:48
without Elena without a new line, and
00:52:51
now we just all that remains is
00:52:54
to write down the correct
00:52:56
conditions here when we print 0 and
00:53:00
when we print 0 no one will
00:53:04
ever see these conditions in fact if
00:53:06
it is not visually displayed, let’s
00:53:08
try to see it visually, here
00:53:11
is a picture, I
00:53:15
have deleted these lines, here is a picture here
00:53:18
now I’ll print, that is, we have
00:53:20
a link only to these numbers, these
00:53:24
numbers are generation
00:53:28
no no no I just completely forgot that
00:53:31
Excel with a tank and fat content cannot be selected
00:53:34
okay an hour it will freeze and close in the most
00:53:39
interesting place as they say
00:53:43
okay
00:53:47
[music]
00:53:49
I’ll need it here draw and just a
00:53:53
little bit
00:53:57
they are from a very fast excel compressor
00:54:00
again
00:54:02
this odd odd
00:54:09
normal fine
00:54:11
no this odd nothing bottom and look
00:54:14
this is this we generate indexes oh
00:54:19
here I will sign what this is oh
00:54:24
well okay then
00:54:33
he was
00:54:35
just no
00:54:38
this is we at all we can to be attached
00:54:42
only to what is dynamically changing,
00:54:45
that is, with each block there is a
00:54:47
dynamic one, oh there is a jake, these are
00:54:50
indexes and we only need to be attached
00:54:52
unambiguously to them and the goal and understand the
00:54:55
dependence when 3.0 and when the cell
00:54:59
is one understand the dependence, this is the
00:55:02
column we have oh generation oh
00:55:07
this is the column we are generating j I will,
00:55:11
for our convenience, sign here
00:55:14
the option oh oh and here are the options j let’s
00:55:18
assume I’ll now take the options I’ll
00:55:22
take this many options when yes and these
00:55:25
many options I’ll take when not that is,
00:55:28
these will be the options when
00:55:30
suppose you need to write a one, but
00:55:33
here are the options for when to write a zero, that
00:55:35
is, I take this cell, alas, not
00:55:41
242
00:55:42
j4 and we print,
00:55:46
suppose I take this card in it
00:55:49
73 and we also print it 73 I
00:55:55
take this cell
00:55:58
40 and we print it too 40 here is pure
00:56:02
logic guys, here is this cell 17 we
00:56:06
will also count it 1 and 7
00:56:09
this cell 77 we also read
00:56:14
77 now when we don’t print examples this
00:56:19
23 we don’t print 23 another one,
00:56:24
let’s say this one 01 we don’t print either
00:56:28
01 well, for example this one we don’t print 65 we do
00:56:33
n’t print either, and now come up with
00:56:36
a chronology, this is your
00:56:39
logic problem when we print and when we don’t,
00:56:53
no, but it will be more difficult to
00:56:57
disassemble each floor, you can deduce it through the box,
00:56:59
and that is, the solution, but
00:57:02
based on logic, this is a
00:57:07
difference of one where here here
00:57:10
here and here good then I
00:57:13
take then I take then when the difference is not
00:57:15
one let's take
00:57:18
assume
00:57:20
3030 now your logic is broken there is no difference there is no
00:57:35
difference there is no one
00:57:38
because here there is not one here
00:57:41
and there is no new one here either and here they are
00:57:43
fascinated by
00:57:48
the context she can’t shop crazy
00:57:52
nothing about
00:57:53
look finally got to the bottom of it they bought
00:57:56
see if there is an amount look you are
00:57:59
confused by the fact that 2 + 4 6 is even to everyone plus
00:58:04
3 is also even 4 + 0 even sims 1 black
00:58:08
14 even a 2 plus 3 odd
00:58:13
50 plus 15 odd 6 plus 5 odd 3 +
00:58:18
0 accounting, that is, we get when
00:58:21
the sum of these and + j is even, we print this in
00:58:26
one here we must write
00:58:30
this word when a and + j is the
00:58:35
remainder of division by 2, this is my poster
00:58:38
I put in parentheses and + j and then
00:58:41
I put a percent sign, the remainder of
00:58:43
division by 2 is 0,
00:58:48
then we print this condition, but otherwise,
00:58:51
print units and
00:58:58
try to run
00:59:03
[music]
00:59:08
errors
00:59:16
yes yes yes, probably
00:59:18
prove it, I got it came out in exactly
00:59:21
one time every other
00:59:23
time, clearly from
00:59:27
[music]
00:59:30
who also put those who are online
00:59:32
pluses
00:59:34
say the same and because also also
00:59:38
guys
00:59:39
[music]
00:59:47
[music]
01:00:05
[music] we’ll
01:00:07
analyze further,
01:00:11
notice now look how we’ll arrange to
01:00:14
play with the conditions, let’s also
01:00:16
try to play with the condition to
01:00:18
for example, here we can set
01:00:21
another condition, for example, how to output
01:00:23
only the main diagonal, for example,
01:00:26
because of all this, we want to
01:00:29
output these cells,
01:00:32
how to output well, output these, let’s
01:00:34
assume one and everything else, but
01:00:39
look at the nicknames, it’s already more expensive, it’s easier
01:00:42
to determine here
01:00:43
0011 2233 that is, oh coincides and we
01:00:48
see it, and then here, if we
01:00:50
play around, try a and equals equal j
01:00:52
to set the condition,
01:00:54
we will see what
01:00:59
will happen now, well, now the zeroes
01:01:04
here, the ones there, the meaning is clear,
01:01:06
what can be done like this
01:01:08
now on this topic 1 homework on this
01:01:17
for everyone there will be homework in this
01:01:22
format
01:01:25
to bring out the water diagonally it will be
01:01:28
more difficult because here it’s not easy but
01:01:32
here are the indices 07
01:01:35
1625
01:01:36
here are the indices for others this is one for those
01:01:41
who are not leaving yet I’ll say right away I’ll just
01:01:44
look at this topic right away for those who
01:01:48
want to start now, Google the following for
01:01:52
those who want something more difficult,
01:01:54
not for everyone but only for the most gifted, he
01:01:57
considers himself like this for everyone, this is
01:01:59
this diagonal, for all the guys this is
01:02:11
[music]
01:02:13
let’s go like this,
01:02:20
this figure will go I’ll save it and
01:02:24
send the screenshots okay, I even
01:02:26
have it in the screenshots already, it’s absolutely gorgeous,
01:02:29
let’s work on the desktop right now, you’re
01:02:33
not here, you can leave it not 8 by 8, you can
01:02:38
leave it as you like completely
01:02:40
[music] like
01:02:43
this for anyone who wants to make it even more complicated
01:02:47
can this is the format they want to display,
01:03:04
they want to make it more complicated, this is what you are doing in this
01:03:07
format, this one is even more complicated,
01:03:13
who wants to make it even
01:03:20
more complicated, this is the last version of the homework so that there is more of
01:03:25
it, but we won’t display the Mona Lisa painting, just like
01:03:31
this, like
01:03:34
this, this will be the last
01:03:37
final version, like this,
01:03:40
but after how you do this you will
01:03:43
fully understand the algorithms, well, these
01:03:46
algorithms are quite good, that’s
01:03:47
why I give them additionally and
01:03:50
because this is already more than the norm, more than the
01:03:53
norm of your course, it’s good just for those
01:03:55
who have time, this is definitely not
01:03:58
enough for you and additional
01:04:00
variables have definitely
01:04:03
passed, now we’ll take a break of 34 minutes
01:04:05
and then we’ll massage the second part in two dimensions
01:04:07
here, we also respect
01:04:15
[music]
01:04:20
[music] [music] [music] [music] [music]
01:05:57
[music]
01:07:13
well
01:07:26
[music]
01:07:53
[music]
01:08:47
[music]
01:09:03
[music]
01:09:13
[music]
01:09:20
continue further
01:09:51
I propose to
01:09:53
do something with the server, it won’t be
01:09:57
easy, but nevertheless you will
01:09:59
actually see how our task is being built on board,
01:10:03
suppose we take a sapper I
01:10:09
play for a pylon
01:10:12
play online
01:10:15
to specifically do
01:10:19
we’ll take suppose
01:10:22
look here sapper
01:10:26
there are buttons beginner amateur
01:10:28
more often 8 some
01:10:42
indicate your name ok
01:10:46
let's go look we asked you to indicate
01:10:50
your name I indicated and then there is a beginner
01:10:53
amateur professional and special special that is,
01:10:58
we indicate the width and
01:11:00
height of the columns and the number of mines our
01:11:03
task for today, if of course we have time,
01:11:06
and I really hope that we have time, we will
01:11:08
program such a part that we
01:11:10
will ask the user to
01:11:13
enter your name and then we say
01:11:18
select the level beginner, amateur,
01:11:21
professional or special, if we assume the
01:11:24
person chooses beginner, we create
01:11:27
2 -dimensional array respectively one two
01:11:30
three 4 5 6 7 8 9 by 12 suppose 9 by
01:11:34
12 and here if here 9 by 12 put
01:11:38
100 cells here on these hundred cells for
01:11:40
about 10 minutes and it is even written that there are
01:11:43
10 of them and our task is to create a 2-dimensional an array
01:11:46
and fill it with ten mines
01:11:50
fill it with 10 names, even this is
01:11:53
the format, but I don’t intend to fill it with 10 house on
01:11:56
if you choose an amateur, then we create
01:11:59
accordingly, for example, there are already 15 by
01:12:01
15 and fill 40 minutes
01:12:04
if a professional, accordingly, so
01:12:07
if a special one, we ask the user to
01:12:10
enter the number of lines the number of
01:12:12
pads and the number of mines and
01:12:15
fill in random everything that we don’t add
01:12:18
we’ll finish at home or in the next
01:12:20
lesson we’ll
01:12:22
make a new class and let’s call it
01:12:25
no longer main let’s call it minesweeper
01:12:37
public static void main
01:12:49
well, let’s assume
01:12:51
we enter the
01:12:54
username it doesn’t matter to
01:12:57
us because it doesn’t play,
01:12:59
let’s ask immediately starting
01:13:02
from the level, that is, the name has been forgotten, here
01:13:06
we start: beginner, amateur, professional
01:13:08
or special,
01:13:09
which means we must print the
01:13:12
system from rental on the console and
01:13:14
select the level of the game and
01:13:25
what we will display, we will display,
01:13:29
suppose one is lost, beginner
01:13:38
2 dash, amateur 3 professional
01:14:02
and
01:14:12
4-7
01:14:19
now
01:14:20
what we already know is that a
01:14:24
type called scanner will be able to read from the console,
01:14:28
and we can
01:14:31
create its object here
01:14:34
skynyrd scanning scania such a
01:14:37
formula is the formula for creating any
01:14:39
object scanner type, then its
01:14:42
name is any absolutely but It’s convenient for me
01:14:45
to put the scanner equal to your
01:14:48
reserved words to create a new
01:14:50
object and the scanner second word
01:14:53
is repeated one to one with this
01:14:55
parentheses at the end. roll it up and there are not
01:14:58
enough parameters here, that is, what we
01:15:00
will read and in our case we
01:15:03
will read systems. and
01:15:06
systems. and
01:15:08
keyboards
01:15:21
further, when we wrote to the users,
01:15:24
select a level,
01:15:26
we will, of course, expect that the
01:15:29
user will enter the level and the level
01:15:32
will be a string in the text for you, but in
01:15:35
fact he can enter, let’s assume,
01:15:38
well, either one or the words
01:15:41
newbie, but let’s you as if he
01:15:43
will directly beat the words beginner
01:15:46
amateur professional or special or
01:15:49
can knock down even a one, two,
01:15:51
three or four, that is, or or
01:15:54
we will take string string in any case, let
01:15:57
's call it suppose level is
01:16:04
equal to
01:16:06
this object of ours scanner scanner
01:16:10
call a method called
01:16:12
next line dexline we get it everything
01:16:16
that comes before enter is what you learned in the last
01:16:18
lesson and
01:16:20
now comes the code fork
01:16:23
warm-up fork consisting of four
01:16:26
options first option second option
01:16:28
3 or 4 if we have four options then we
01:16:34
do 4 if i fall so i feel so if so if
01:16:39
yes, that is, we will have four options,
01:16:43
the candle will be less readable, maybe I do
01:16:47
n’t know, purely theoretically, why
01:16:49
the switch won’t work because the
01:16:52
user might miss the one or the words
01:16:54
newbie and milf, we can indicate
01:16:58
that if the user ben one, Elena is a
01:17:00
beginner, okay with the candles we can’t
01:17:04
therefore here it’s best iv and in
01:17:07
parentheses the body
01:17:10
and
01:17:14
here we indicate
01:17:16
the conditions
01:17:17
now we get acquainted with the
01:17:20
additional method level this
01:17:23
variable is of type string and
01:17:26
if it were a primitive type we
01:17:30
would compare using the equals equals
01:17:32
equals operator it compares
01:17:35
justified what is this unit or is it true
01:17:38
that it is new but reference types cannot be
01:17:42
compared using equals equals because
01:17:45
equals equals operator it
01:17:48
only works correctly on primitive types on
01:17:50
reference types if we want to compare
01:17:53
and say justified that level is a
01:17:55
unit we should do it using
01:17:58
method of methods from the name equol, this
01:18:02
method lives in the string type and in
01:18:06
fact such a method and it lives in absolutely
01:18:09
any reference now in all Gaviscons
01:18:12
and it always compares two objects and
01:18:15
says they are equal or not, it turns out
01:18:18
here my level.
01:18:21
and call a method called and quill and
01:18:25
the method will be compared with the second
01:18:27
object, which we will put here in
01:18:29
parentheses and will return an
01:18:32
answer in the format yes or no, which is exactly what
01:18:35
suits us, that is, we immediately
01:18:37
justified that there is a unit in the double
01:18:40
quotes
01:18:42
we are equal and
01:18:45
we can also put the icon or
01:18:51
or newbie correctly, only here is
01:18:54
another important point, I’m copying this
01:18:57
sequel unit, it seems like it’s
01:19:00
only here that the important point is digging, we
01:19:03
can also call another method
01:19:06
called and sailed and in the sea the case is very
01:19:08
convenient equality is not case sensitive, this
01:19:12
means that the newcomer is small or
01:19:14
large, it will be a beginner, but how would it
01:19:16
be equal to the beginner of the words, this one is
01:19:18
their 1 and the case suits us perfectly and
01:19:21
here we will sign conditionally a beginner and it doesn’t
01:19:25
matter how we write it small or
01:19:27
large
01:19:29
then it will work on this
01:19:32
piece of code,
01:19:35
we will start here with which you will
01:19:38
finish just we will at least do it for a beginner
01:19:40
today
01:19:44
if this is a beginner
01:19:48
if this is a beginner this has been added
01:19:54
if this is a beginner when I go here and
01:19:59
see that oils are being created one two three 4 5
01:20:02
6 7 8 9 by 1 2 3 4 5 6 7 8 9 9 by 9
01:20:07
then here I am creating a 2-dimensional array 9
01:20:11
by 9, only again the important point
01:20:15
is what type
01:20:17
is stored inside our two-dimensional array and here we
01:20:22
ourselves can come up with what exactly will be
01:20:24
stored well,
01:20:26
that is, if this 9 by 9 is such a
01:20:29
2-dimensional array, we can indicate that we
01:20:33
can indicate the first option
01:20:36
that
01:20:38
Lilith is not pressing anything there now, okay, I
01:20:41
understand it will delete there is no such thing to divide the forest the
01:20:44
first option we can store numbers,
01:20:47
let’s assume everything is filled with zeros and by the way,
01:20:50
we will have minus 1, let’s assume, or we
01:20:53
can store here
01:20:55
how we will designate mines, that is, we
01:20:57
need to come up with a web programmer how to
01:20:59
designate mines, we can purely
01:21:02
theoretically declare this array bully
01:21:04
Navsky and if there is a fall in the cell, then it means
01:21:07
I’m not there, but there is a mine you can do this, let's
01:21:11
say save here indicate int
01:21:14
new will exactly mean put -1
01:21:17
from for us this is as convenient as possible why I
01:21:21
'll explain because if when I clicked
01:21:23
one it was displayed one means there is
01:21:27
one mine going around and
01:21:30
I hit it excellent
01:21:33
art that is, look here means here
01:21:38
this 2-dimensional array is well
01:21:40
filled with mines and numbers, and the numbers in general are
01:21:44
nowhere to be found, and the numbers are designated
01:21:48
accordingly, look, if
01:21:50
we have exactly -1, then the number will
01:21:54
indicate how many mines there are around this cell,
01:21:57
so it’s best to indicate, let’s
01:22:00
assume that a mine is - 1 2-dimensional
01:22:04
array is numeric, that's why
01:22:06
here let's indicate the
01:22:09
numeric icon of the 2-dimensional array and
01:22:13
call it
01:22:15
main field before or mainz mine is mine
01:22:20
or fields best of all this feels
01:22:25
field
01:22:27
equals new
01:22:31
array 9 by 9 because the user
01:22:34
chose a newbie
01:22:46
because user newbie
01:22:50
10 min we already know that we need to
01:22:53
arrange 10 min here are our fields 9 by 9
01:22:57
so she became
01:22:59
9 by 9
01:23:03
beauties here mines randomly assume
01:23:06
here I randomly you floor here and
01:23:09
here I save -1 but it will be a mine and you
01:23:13
kicked here and here we save minus
01:23:15
one this and here there is no minus from this but
01:23:18
you can’t do it like that in Java
01:23:21
correctly what did I actually do and what
01:23:23
if I poked and here actually I
01:23:27
somehow took it out of the sky the number two and the number 6
01:23:30
I somehow came from the sky, which means I generated
01:23:33
two numbers for myself, two indexes, two indexes from the
01:23:37
ceiling I generated which are the
01:23:40
row index, column index and now all that remains is
01:23:43
the correct Java query to do this in
01:23:47
java and
01:23:53
let's call it get random number in range, so I
01:23:58
would say so bad
01:24:00
random
01:24:03
number
01:24:05
in range in the range because why in the
01:24:09
range because if somewhere there is a random
01:24:11
number then it’s generally in total
01:24:12
on and we need in the range in the range of the
01:24:15
flash drive index we have indexes from 0 to 8
01:24:19
here and from 0 to 8 here it means we have
01:24:23
this random number we need to take and
01:24:26
so I take stack overflow
01:24:32
and
01:24:34
here is how to generate random
01:24:36
numbers using specific
01:24:40
jawing ranges here is the request 3,900 likes excellent
01:24:44
70 replies
01:24:46
4,170 9 likes that is, here they indicated
01:24:48
that you will import something
01:24:50
like this here is a file of local brand environments and it
01:24:53
contains this value, we
01:24:56
can already roughly understand, look like the
01:24:59
declaration of an integer random number, that
01:25:03
is, there will be a huge value assigned here, it
01:25:05
says cheese and cried
01:25:08
random, this is a file, how do I know that this is a
01:25:11
file because is written with a capital letter
01:25:12
and in this file
01:25:15
some method called car and what
01:25:18
it returns no idea maybe it
01:25:21
returns an elephant I don’t know but this elephant it
01:25:24
calls the next method
01:25:27
called next and that is, someone who
01:25:29
was returned using the method cards without
01:25:32
a clue who called a method
01:25:35
called next and expert in it, I guess
01:25:38
that this method says the next number and the
01:25:40
minimum number is inserted here and the
01:25:43
maximum number is inserted here, that is, in our
01:25:46
case the minimum number is 0,
01:25:48
the maximum number is 8 and here I
01:25:51
insert 0 and 8 and this combination
01:25:55
gives birth to me again and eights, one
01:25:59
random number, the meaning is clear, that is, these are
01:26:02
these moments, how to
01:26:05
create we will still analyze starting
01:26:08
from lesson 5, from lesson 5 we will fully
01:26:11
study how to call other people’s
01:26:14
methods, but so far we have only just seen a
01:26:17
piece of code and we can just
01:26:20
integrate this difficult moment or
01:26:21
no guys there is no no for you
01:26:24
girls
01:26:25
[music]
01:26:29
look at this moment for now
01:26:31
this piece of code should be
01:26:33
understandable by 2 out of 10 something like
01:26:36
two out of ten Now, if two out of
01:26:38
ten is clear, then it’s fine,
01:26:40
we’re going fine, because
01:26:43
this piece oh yes, this is not the topic of
01:26:45
today’s lesson, today we
01:26:46
ran a cycle in a cycle, so it’s fine,
01:26:49
I’ll copy it,
01:26:51
send it to you in a telegram,
01:26:56
or let’s do it without a telegram, but here we
01:26:59
’ll write it int
01:27:02
random, well, that is, we
01:27:05
will have to generate the first number for ourselves a
01:27:07
random row index and the second number
01:27:11
is a random index flanker random
01:27:14
row index I will call it and
01:27:17
random
01:27:19
ditch
01:27:22
index
01:27:24
equals and
01:27:26
now I take the wording directly from here Wednesday
01:27:29
local random that is, I start
01:27:32
writing with a capital letter Fred local I
01:27:36
randomly find this file that
01:27:39
was written there and I definitely
01:27:42
click on it twice when I
01:27:44
splashed it twice from above and imported it
01:27:47
because it’s the same
01:27:49
ready-made type, someone’s ready-made type that
01:27:52
we will use and I’m
01:27:55
ready for it now we were told to
01:27:59
call his method called car
01:28:01
and, that is, I put a dot and here it is a
01:28:04
method called car and
01:28:07
and then next in is called, well, that
01:28:12
is, and
01:28:14
then they tell me to put a dot again
01:28:16
and call expand, put a dot and
01:28:20
call to extend here, having deprived that to
01:28:22
the extent of several empty empty if
01:28:26
empty will be given most likely that any
01:28:29
number is not in the
01:28:31
inbound range I don’t know what it is it’s necessary to
01:28:33
read what they give here and this one
01:28:37
is our one that we give two numbers from
01:28:39
and to z
01:28:43
now I’ll point it out, look, if we don’t
01:28:46
know what it is,
01:28:47
I’ll point it out here, I’m sleeping, I gave one thing so
01:28:51
that exactly that method
01:28:54
would be called up for me, and now look, when I
01:28:56
point it at it, its description of this method comes up,
01:28:59
and here I’m copying from this description
01:29:02
here is this text, that is, and
01:29:06
now I’m going to Google Translator, that is,
01:29:09
this is the format if you don’t know how
01:29:11
the method works, go to Google
01:29:13
Translator, insert it, it
01:29:15
returns a
01:29:18
very interesting pseudo all to a random
01:29:21
value in the between zero inclusive
01:29:25
and the specified boundary exclusively, that
01:29:28
is, from 0 up to
01:29:30
and we have indicated here up to how much, that is,
01:29:32
purely theoretically, if it is indicated,
01:29:36
look, it is indicated and the indicated limit is
01:29:40
upper exclusively, that is, it
01:29:43
will not be taken into account, this is ideal for us,
01:29:46
we can put 9 here
01:29:49
because we have from 0 to 8 inclusive
01:29:53
up to 9 not inclusive we needed to
01:29:56
indicate yes not inclusive so we
01:29:58
indicated yes not inclusive
01:30:01
that is in the villa and now you have a complete
01:30:04
description of this method Karen also in the
01:30:07
villa also has a description of what
01:30:09
is returned to here not the elephant it turns out
01:30:12
returns the
01:30:13
current flow current flow
01:30:18
here we generated a random index,
01:30:25
we generated a random index for the
01:30:28
column of the oh row, but now we need
01:30:32
to generate another index because
01:30:34
we generated yandex, this one, and
01:30:36
now we need to generate yandex, this one,
01:30:40
respectively, we just copy this
01:30:42
line and paste it below again, here are
01:30:46
also indexes the column is also up to 9, only
01:30:49
here we are already signing with random calls,
01:30:52
let’s assume the column house floor gender Yandex
01:30:57
Yandex Yandex columns
01:31:01
and
01:31:08
so we were given a row index
01:31:11
column index and now by this index the
01:31:14
Yandex row of the columns in this two-dimensional array
01:31:16
is assigned -1 that is, fields by Yandex
01:31:22
random ditch index and secondly the goal
01:31:28
index
01:31:29
is equal to -1 for us the designation minus 1
01:31:34
will be the designation of a bomb
01:31:45
but
01:31:47
we did this for one bomb and
01:31:51
how much do we need in total
01:31:53
10 and we have the option to either copy
01:31:57
and paste the code 10 times by numbers
01:32:00
to loop these 3 lines so that they
01:32:03
repeat 10 times and I propose, of
01:32:07
course, the gypsies to loop, so before these
01:32:12
three three lines here they will begin the
01:32:15
cycle background in
01:32:17
parentheses of the body and
01:32:20
these 3 lines
01:32:23
I will cut and paste accordingly here and
01:32:29
here I specifically named the variable no oh
01:32:33
she sound variable names
01:32:38
because
01:32:41
it turns out like this int
01:32:45
mine equals zero
01:32:48
while the miles are less than 10
01:32:52
minutes and plus plus we are spinning this 1
01:32:57
2 3 4 so it turns out 10 minutes we arrange
01:33:23
[music]
01:33:25
minus one this is what we assign to our
01:33:29
field the value of the bomb this is minus 1 this
01:33:32
will be y us bomb designation I would
01:33:35
now launch it in cottage cheese mode and
01:33:38
set the debak mode specifically
01:33:41
here when we connect the scanner
01:33:44
we will ask for the entered line and then
01:33:46
we will add the
01:34:00
program I wrote, it turns out
01:34:02
select the game level and then created a
01:34:06
scanner and stopped here good
01:34:09
point I Accordingly, I
01:34:11
type in, let’s just say one, I press
01:34:13
enter, now the one will be saved here, the
01:34:17
milf will ask for one, there aren’t many of them
01:34:20
dance, it seems, yes, that is, I press enter, so
01:34:23
she asked the one and quill one,
01:34:27
she says yes,
01:34:29
then it is created by a field of length 9 by 9, the
01:34:33
next step and here we have a field field
01:34:37
if I’ll expand it, it turns out 9 by 9
01:34:40
completely filled with zeros, the first
01:34:43
line in it is a two-dimensional array of days 9, the
01:34:47
second line in it is an array of 9 because
01:34:49
I said this is the ground floor 1 2 3
01:34:53
and so on, here we see a 2-dimensional array
01:34:55
then we say not equal to zero with
01:35:00
me alone they didn’t fill in 0 less than ten
01:35:02
until
01:35:04
we take random Yandex
01:35:07
Yandex random we took four
01:35:10
generated we take 2 random
01:35:13
column index it was generated 2 it turns out
01:35:17
42 we say the field under index 4 2
01:35:21
assign the value -1 and now here
01:35:25
here it appeared in -1 because it’s
01:35:28
just zero one two three four and
01:35:31
column 012, now we take mine plus
01:35:37
plus the next mine,
01:35:39
we generate a random row index, a
01:35:42
random column index, we got
01:35:45
eight and six and we assign it to a
01:35:48
cell called 86 here - 1 here
01:35:52
we have placed the second menu and
01:35:54
are making the next circle, the third mine has now
01:35:57
passed,
01:35:58
we took the tracker index, the column index
01:36:01
came out on iOS
01:36:03
6
01:36:06
and 3 and
01:36:07
assigned, respectively, here is 63, the
01:36:11
meaning of the guys is clear, that is, this is how we
01:36:14
get 4 minus 5 minus 6 and minus
01:36:19
made the seventh lumen 8 9 and 10 have everything and
01:36:26
now we get zeros everywhere, but
01:36:30
where the mines melted -1 is
01:36:33
completely random and we, as java programmers,
01:36:37
regardless of this, randomly came
01:36:39
up with it, so we can’t
01:36:41
say in any way, substitute something here
01:36:44
will always be everyone at the same time
01:36:52
it turns out differently we have arranged it
01:36:55
only for
01:36:57
it turns out level 1 level 1 let's
01:37:02
now it turns out here
01:37:05
below here
01:37:10
accordingly now I
01:37:12
will put we to where the comments are here we
01:37:15
will also have level 2 level 3 and
01:37:18
level 4 but here below right away I
01:37:21
I’ll make a piece that prints a
01:37:23
minefield like this, I’ll write a
01:37:27
field with mines,
01:37:36
that is, there will be one and then a second and a
01:37:40
third and a fourth and we’ll print a field with
01:37:42
mines
01:37:45
here, this is also an important point in
01:37:48
accessing your minefield, no, I’ll
01:37:51
explain why because here this part
01:37:53
is called the declaration of the variable
01:37:56
field and where it is declared in what
01:38:00
body it is declared here and the scope that is,
01:38:03
it lives here this
01:38:05
variable it lives from this curly
01:38:08
brace to this one here it is not visible if
01:38:11
we would like to use this
01:38:14
variable field here we need to increase its
01:38:19
scope of visibility
01:38:20
increase the scope of visibility that is, let’s
01:38:23
put this part of the ad in
01:38:26
front of the if so that it is visible, it is
01:38:30
visible and here we understand the meaning,
01:38:34
accordingly, I copy this part of the ad
01:38:37
and put it in front of the if and
01:38:44
let’s just put a dot I do
01:38:47
n’t get along with the comma because
01:38:50
I can’t put it here, but here
01:38:53
when we said that we caught this unit,
01:38:56
we simply assign it further to this variable,
01:38:59
that is, we
01:39:01
split this one line into two
01:39:03
lines in order to increase the scope
01:39:08
and now here, where it is signed,
01:39:11
we print the field with mines, we have a boss
01:39:14
topfield,
01:39:15
we print the field with mines, which means we
01:39:17
will have a cycle in a cycle that goes through
01:39:20
generates indexes of Yandex rows and
01:39:22
columns of forms, parentheses body
01:39:28
and a and equals zero
01:39:33
while a and less than a here we definitely have to
01:39:37
say the number of lines because
01:39:40
the number of lines can be different and
01:39:43
can be 9 by 9 if a beginner has chosen and
01:39:48
then there may be a larger one right,
01:39:49
so at this point in time it can be
01:39:52
different, so we definitely say
01:39:55
film. winx
01:40:28
here entoy is equal to zero while a and
01:40:33
less than
01:40:34
fields . link
01:41:04
i plus plus .
01:41:08
links and
01:41:10
now look at this moment, what will it
01:41:14
rewrite here so that there will never be an
01:41:17
error? an error could be if suddenly there
01:41:20
is no crown to this line
01:41:23
of filling, then it says that the film
01:41:26
variable must be assigned
01:41:29
some value to it, and if this moment in
01:41:32
time we can’t assign some
01:41:34
value because we don’t we don’t know
01:41:36
what else it should be 9 by 9 16 by
01:41:38
16 so on then we assign an empty
01:41:41
space
01:41:42
since it’s already a reference type we’re
01:41:45
kind of because a primitive type is simple
01:41:48
and a massive this is already a reference type, but
01:41:50
all reference types, if we want to
01:41:53
assign an empty space to them, we assign the
01:41:55
following words, well, it’s empty, there a
01:41:59
primitive type cannot go into the void,
01:42:02
this is only an advantage of reference
01:42:05
types, but this is the same as what I’m
01:42:07
telling you, I have Let's assume sister
01:42:12
Suzanne, here is Suzanne, this is a link that
01:42:16
can either meddle with an object or not
01:42:18
refer, if I deceived you, then the
01:42:20
link Suzanne refers to an empty space,
01:42:23
the link exists, but Suzanne as a person does not exist, and
01:42:26
here the same thing, we indicated that it
01:42:30
will be Suzanne, only links so far
01:42:32
nowhere they don’t shine, but here we
01:42:34
assign it a value, but now
01:42:37
the relation swears,
01:42:40
so we generated
01:42:42
Yandex for ourselves and further lines we
01:42:45
make an internal for loop that generates
01:42:47
indices to the crowbar
01:42:50
in the same way, int j is equal to zero as long as
01:42:55
j is less than
01:42:57
fields for yandex.
01:43:02
links
01:43:04
you don’t write then
01:43:06
everything is fine j + + and
01:43:12
here we print the current cell let’s do
01:43:15
this if there is a mine in the cell then we print
01:43:20
assume
01:43:21
an asterisk and
01:43:24
if there is an asterisk in the cell let’s print an
01:43:27
empty space that is a space
01:43:29
accordingly we will have iv and
01:43:32
lc
01:43:37
if in cell mine means we say
01:43:41
if fields at index a and
01:43:45
j is
01:43:48
equal to -1 because we -1
01:43:52
said that this is minutes if in the
01:43:55
current cell there is a mine then we make a system of
01:44:00
sprint tapes with
01:44:03
an asterisk and a space in order to
01:44:06
align the move or let's make
01:44:10
a space asterisk space like this space
01:44:12
asterisk space
01:44:16
if mine and if they are on the printer system
01:44:21
and with space and make three spaces, that
01:44:24
is, an empty space will be printed and
01:44:28
here we will delete it so that there is
01:44:32
printing in one line and the
01:44:35
transition to the second line will be
01:44:38
accordingly after the internal cycles
01:44:41
and here the systems bring hp.
01:44:47
accordingly, it will be like this,
01:45:01
let’s run it in normal mode and
01:45:09
now select either the words newbie or
01:45:12
one,
01:45:27
I choose let’s say newbie and this is how the
01:45:35
field was printed for me,
01:45:39
why the field was printed like this, just
01:45:41
like this, this is printed as an empty
01:45:44
space, and this is how it is printed if there
01:45:46
was a mine year there was a mine, they
01:45:48
saw a minefield
01:45:51
instead of an empty space, put something
01:45:55
instead of an empty space, probably you can
01:45:58
put a dash or a plus sign, let’s do it for the Terek,
01:46:09
let’s get the beginner to one, well, I
01:46:13
’ve put the trees, now you can see
01:46:15
where the min is one two three 4 5
01:46:20
by the way, I’ll give one more task with
01:46:23
asterisks and we haven’t finished yet, we have a
01:46:25
10-minute
01:46:28
task with an asterisk, who wants to think
01:46:31
and experiment, look what
01:46:34
you see, I launched how long we have a
01:46:37
background loop, our for loop rotates from 0 to 10,
01:46:42
that is, it is logical that 10 minutes and
01:46:45
now we count 1 2 3 4 5 6 7 8
01:46:51
why 8 and now if we run it, let’s
01:46:55
assume again I’m speaking as a newbie now
01:46:58
I’m counting one two three 4 5 6 7 8 9
01:47:04
who understood the jokes are
01:47:09
not done in a loop but you know what random
01:47:13
everything is fine guys we were able to
01:47:16
generate 2 times 1 already numbers that is, there
01:47:19
was already a bomb there and we put
01:47:22
a bomb there again, this effect happens,
01:47:24
and in our case, out of ten times, once
01:47:28
for lemonade in the cell where there was already a
01:47:30
bomb, so whoever wants a task with an
01:47:32
asterisk, please, that is, you can
01:47:37
make it so that we
01:47:40
so that we always get 10 so that
01:47:45
we always get 10 and let's now, since there
01:47:48
is still time, let's also make an
01:47:51
amateur level and a professional level
01:47:54
and special ones you will need an
01:47:57
amateur, that is, we need to copy
01:48:00
this one and this one and here it turns out
01:48:05
without this filter
01:48:08
we copy this iv and paste it right
01:48:12
here below and
01:48:14
edit it if it’s level 2 or an amateur
01:48:23
and now I’m coming from this site, by the way, I
01:48:25
sent you this site, why not so
01:48:29
that you can see how it’s implemented there,
01:48:37
here we click on an amateur, so I’m counting
01:48:40
how many lines it turns out times two three 4 5 6 7 8
01:48:43
9 10 12 14 16 let us go 16
01:48:53
times two three 4 5 six 7 8
01:48:57
in vain 16
01:49:00
yes and 40 minutes
01:49:04
if 40 minutes then here up to 40
01:49:07
accordingly under the correct one and everything
01:49:09
else is the same, that is, like this
01:49:11
amateur level
01:49:25
this father is
01:49:27
not 15 but here they indicated up to the upper
01:49:31
limit not inclusive the upper limit
01:49:34
means up to 16 because 15 we still need
01:49:37
the index 15 to 16 to ok according to
01:49:51
let's 2 like
01:49:54
this
01:49:56
in principle I believe that it is about the same
01:50:00
we one hundred percent you know that there are
01:50:02
less than 40 bombs here because you
01:50:04
could have stepped on one of them twice, but on the
01:50:07
whole it fills out correctly, everything is ok that
01:50:10
you will have a little more difficult than a
01:50:12
professional, it’s clear that it’s kind of
01:50:14
easy here, but special ones you need to request
01:50:17
accordingly the number of lines,
01:50:20
number of columns and the number of mines and
01:50:23
what will be the problems with yours, I’ll immediately say
01:50:25
what the problems will be, that what
01:50:27
the user enters,
01:50:29
he will enter in text format, and your
01:50:32
task is that if you want it to
01:50:34
work, you need to convert it into a number
01:50:36
and how to convert it into a number, you check
01:50:39
in on the Internet you convert 100 from text to number
01:50:41
and because
01:50:44
this is this this is this text you can work with it
01:50:47
as with text with this variable it
01:50:48
will not be possible to divide plus minus for us
01:50:51
and so on,
01:50:52
it’s like homework who decides this and
01:50:56
does it like whatever the main thing, we
01:50:59
say the task is that it will just be taken from the number
01:51:02
it turns out and
01:51:04
it’s most likely not all of it will be
01:51:08
homework, and even if it is, I’ll dump it for you,
01:51:10
well,
01:51:17
professional, I dumped it ourselves, you need to
01:51:20
calculate it well,
01:51:25
the one who wants to go even deeper forward, of
01:51:29
course you can further sakura write in
01:51:31
the sense that think about how it might be,
01:51:33
but in general, within the framework of classes, it might be
01:51:35
there somewhere in class ten to
01:51:37
eleven and we’ll add it to the cathedral, that
01:51:40
is, now you just started it, then
01:51:41
we’ll have a possible default, maybe we’ll add
01:51:44
it because it’s basically quite
01:51:46
still interesting and for developing a screen
01:51:50
questions 10 guys
01:51:53
[music]
01:51:57
homework I get 3 screenshots I’ll dump yes
01:52:01
ok I’ll formulate it again I’ll write down what
01:52:04
you need to finish ok I’ll formulate it again I’ll write
01:52:07
it down and we’ll meet with you on
01:52:09
Monday Monday
01:52:11
1930 all those who don’t have questions
01:52:15
guys
01:52:18
great great everything then see you on
01:52:21
Monday

Description:

On this page you can download the media «Занятие 4 (08.06.22) Java (основы) поток 32» highest quality possible WITHOUT any restrictions on the number of downloads or download speed.

Preparing download options

popular icon
Popular
hd icon
HD video
audio icon
Only sound
total icon
All
* — If the video is playing in a new tab, go to it, then right-click on the video and select "Save video as..."
** — Link intended for online playback in specialized players

Questions about downloading video

mobile menu iconHow can I download "Занятие 4 (08.06.22) Java (основы) поток 32" video?mobile menu icon

  • http://unidownloader.com/ website is the best way to download a video or a separate audio track if you want to do without installing programs and extensions.

  • The UDL Helper extension is a convenient button that is seamlessly integrated into YouTube, Instagram and OK.ru sites for fast content download.

  • UDL Client program (for Windows) is the most powerful solution that supports more than 900 websites, social networks and video hosting sites, as well as any video quality that is available in the source.

  • UDL Lite is a really convenient way to access a website from your mobile device. With its help, you can easily download videos directly to your smartphone.

mobile menu iconWhich format of "Занятие 4 (08.06.22) Java (основы) поток 32" video should I choose?mobile menu icon

  • The best quality formats are FullHD (1080p), 2K (1440p), 4K (2160p) and 8K (4320p). The higher the resolution of your screen, the higher the video quality should be. However, there are other factors to consider: download speed, amount of free space, and device performance during playback.

mobile menu iconWhy does my computer freeze when loading a "Занятие 4 (08.06.22) Java (основы) поток 32" video?mobile menu icon

  • The browser/computer should not freeze completely! If this happens, please report it with a link to the video. Sometimes videos cannot be downloaded directly in a suitable format, so we have added the ability to convert the file to the desired format. In some cases, this process may actively use computer resources.

mobile menu iconHow can I download "Занятие 4 (08.06.22) Java (основы) поток 32" video to my phone?mobile menu icon

  • You can download a video to your smartphone using the website or the PWA application UDL Lite. It is also possible to send a download link via QR code using the UDL Helper extension.

mobile menu iconHow can I download an audio track (music) to MP3 "Занятие 4 (08.06.22) Java (основы) поток 32"?mobile menu icon

  • The most convenient way is to use the UDL Client program, which supports converting video to MP3 format. In some cases, MP3 can also be downloaded through the UDL Helper extension.

mobile menu iconHow can I save a frame from a video "Занятие 4 (08.06.22) Java (основы) поток 32"?mobile menu icon

  • This feature is available in the UDL Helper extension. Make sure that "Show the video snapshot button" is checked in the settings. A camera icon should appear in the lower right corner of the player to the left of the "Settings" icon. When you click on it, the current frame from the video will be saved to your computer in JPEG format.

mobile menu iconWhat's the price of all this stuff?mobile menu icon

  • It costs nothing. Our services are absolutely free for all users. There are no PRO subscriptions, no restrictions on the number or maximum length of downloaded videos.