Download "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ"

"videoThumbnail БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ

Решение задания №10. ЕГЭ по информатике - 2017. Демоверсия ФИПИ.

Решение задания №10. ЕГЭ по информатике - 2017. Демоверсия ФИПИ.

Channel: Информатик БУ

Финансовый рынок. ЕГЭ по обществознанию.

Финансовый рынок. ЕГЭ по обществознанию.

Channel: Анна Малкова

Полный разбор демоверсия ЕГЭ ИНФОРМАТИКА 2024 | Умскул

Полный разбор демоверсия ЕГЭ ИНФОРМАТИКА 2024 | Умскул

Channel: Информатика ЕГЭ Умскул

Задание 1 | ЕГЭ по информатике | ДЕМО-2023

Задание 1 | ЕГЭ по информатике | ДЕМО-2023

Channel: Иван Викторович

ВЕСЬ PYTHON ДЛЯ ЕГЭ 2023 | МАРАФОН ПО ИНФОРМАТИКЕ | УРОК 2 | 99 БАЛЛОВ

ВЕСЬ PYTHON ДЛЯ ЕГЭ 2023 | МАРАФОН ПО ИНФОРМАТИКЕ | УРОК 2 | 99 БАЛЛОВ

Channel: ИНФОРМАТИКА ЕГЭ 2024 99 БАЛЛОВ

ВСЕ ТИПЫ 7 заданий | Информатика ЕГЭ 2023 | Умскул

ВСЕ ТИПЫ 7 заданий | Информатика ЕГЭ 2023 | Умскул

Channel: Информатика ЕГЭ Умскул

ЗАДАЧИ, КОТОРЫЕ НЕ РЕШИТЬ НА PYTHON | 99 БАЛЛОВ | ИНФОРМАТИКА

ЗАДАЧИ, КОТОРЫЕ НЕ РЕШИТЬ НА PYTHON | 99 БАЛЛОВ | ИНФОРМАТИКА

Channel: ИНФОРМАТИКА ЕГЭ 2024 99 БАЛЛОВ

ГИГАНТСКАЯ ЛЕСТНИЦА ТЕСТ IQ 999.999.999 МЕТРОВ ЧЕЛЛЕНДЖ НУБ И ПРО ВИДЕО ROBLOX

ГИГАНТСКАЯ ЛЕСТНИЦА ТЕСТ IQ 999.999.999 МЕТРОВ ЧЕЛЛЕНДЖ НУБ И ПРО ВИДЕО ROBLOX

Channel: Робзи

Разбор НОВОГО 6 задания из ДЕМО ЕГЭ 2023 по Информатике | Умскул

Разбор НОВОГО 6 задания из ДЕМО ЕГЭ 2023 по Информатике | Умскул

Channel: Информатика ЕГЭ Умскул

15 ДНЕЙ ДО ЕГЭ. ЧТО ДЕЛАТЬ? Шаблоны программ по информатике

15 ДНЕЙ ДО ЕГЭ. ЧТО ДЕЛАТЬ? Шаблоны программ по информатике

Channel: Информатика ЕГЭ Умскул

егэ

информатика

информатика егэ

егэ информатика

егэ 2021

информатика егэ 2021

егэ 2021 инфа

егэ 2021 информатика

экзамены

ответы егэ

6 задание егэ информатика

27 задание егэ

как решать 6 задание егэ информатика 2021

быстрое решение егэ информатика 2021

игры

репетитор егэ информатика

лучшее решение заданий егэ информатика

00:00:02

big bag again and this is how to quickly solve the 6th

00:00:05

task of the Unified State Exam in computer science for 2021

00:00:09

on the computer to the left of me, the

00:00:11

demo version of the Unified State Exam 2021 to the right

00:00:14

of me is open the version that was posted by

00:00:16

Fipi at the end of April 21 and so many

00:00:20

will think

00:00:21

why solve task 6 in general on a

00:00:24

computer knives easy fret 22 there yes but

00:00:27

task 6 it can be solved manually

00:00:30

but in Odessa it’s not so easy because

00:00:32

conditions have been added for what is the largest

00:00:36

or smallest value of

00:00:37

the variable s program people such a number

00:00:40

this is exactly the task that has dumped many on

00:00:43

the sampler which was in the fall of

00:00:46

1920, why because everyone was searching

00:00:49

manually on a piece of paper quickly but did not

00:00:52

look for the meaning, few should

00:00:56

understand how to look for no more or even

00:00:58

less value and therefore I will tell you

00:01:01

how to solve this task relatively quickly

00:01:04

in any language show me I’ll be

00:01:07

in Python, oh, sorry, in Pascal, you can use

00:01:11

Python and it doesn’t matter at all, so the first step is

00:01:14

you retype the code for any environment

00:01:17

that you generally program that is

00:01:20

convenient for you, I will be shown pascal, here,

00:01:24

fortunately, you can copy the code,

00:01:28

so how would I copy it, here is the code

00:01:31

that do the first thing we do is we

00:01:35

add a change oh second step place

00:01:40

riedel n that is, the place of input our

00:01:42

changes from to which we are actually looking for

00:01:45

we write s equal to the oh axis we will

00:01:50

have the values \u200b\u200bthese here oh and what is

00:01:53

it you ask or even y for us it is for

00:01:56

high

00:01:57

from 1 to 1000, let’s say oak gear and at the

00:02:01

end we will now

00:02:03

write and that is, this is not a

00:02:05

large cycle in which we have put

00:02:08

this entire program, that is, it

00:02:12

will automatically ask and it

00:02:15

will automatically remove the cycle for the purpose oh that is

00:02:17

here is the value of s and count and

00:02:21

print n, but why do we need this if we

00:02:25

need exactly 64 m equals that is, we do

00:02:30

n’t need to sort through all the value son, we

00:02:34

just use wright l.n. let's write if

00:02:39

let's put a parenthesis

00:02:41

and a equals equal to 64 for some kind of joke

00:02:46

not government programs to see the number 64 that is, and it

00:02:49

will be output n if n is equal to 64 years

00:02:53

then wright l.n. we write like this here in quotation marks

00:02:58

it will print for us oh that is out of 100 but

00:03:02

we have it oh no need to print here oh

00:03:07

why because it changes here and

00:03:09

in principle it can almost go wrong oh

00:03:13

space let’s here and actually itself n

00:03:18

just to check so that you can make sure

00:03:20

that this cycle that this method works,

00:03:22

that is, we create such a cycle for oh

00:03:26

from 1 to 1000 others at the end we close and

00:03:29

place in the raider n.m. or the printer we write

00:03:34

if n is 64 then print this

00:03:38

and why altero m now you

00:03:42

look after pressing the play button

00:03:47

we will see that Pascal gave us a rest

00:03:51

value, that is, he gave us all the

00:03:55

values s well or oh or s well it doesn’t matter for

00:03:59

us here with understand the value at which

00:04:01

n will be equal to 64 all values, that is, and here it is, and

00:04:07

with whom our son is all 4, that is,

00:04:13

given 210 blah blah blah blah blah and

00:04:16

so on we will have this all we

00:04:20

will actually look like and 64 you you can

00:04:23

go back and check these numbers

00:04:25

yourself, but we did it all quickly, we are

00:04:30

sure because it always works, it

00:04:32

works even for 22 tasks, I will make a

00:04:35

separate video about the 20th task, it is

00:04:37

solved in exactly the same way, only there are just

00:04:40

two changes at the end, but oh

00:04:43

well and the question is, what is the largest

00:04:46

value with the program to see the number

00:04:49

64 no more no less we have 210 and

00:04:54

let’s find let’s scroll to the end the

00:05:00

highest value we have is 259 we

00:05:04

cycle up to 1000 so 259 is not the limit and it’s

00:05:08

always better of course how to set it for me

00:05:10

from 1 to 1000 so that if anything

00:05:14

take the entire range and the answer is 259

00:05:20

and that’s all we have the answer here is 259 I hope I

00:05:28

explained everything clearly because all of this is

00:05:30

actually very simple if

00:05:32

you don’t understand what he said in general just

00:05:34

repeat everything

00:05:35

the way I did it take pascal so that it doesn’t

00:05:39

float, I’ll go to whoever is more convenient, python, let them

00:05:42

take concrete when you come to this cycle

00:05:49

for right now up to 1000 to begin end and

00:05:51

just if we have equal to 64 or whatever is

00:05:54

involved here, output to

00:05:56

what we have here are output here, here

00:05:58

we are actually here print and

00:06:03

print we can just print n yes if

00:06:07

equal to 64 print print oh

00:06:13

print and I have it looks like I

00:06:15

value let's try with it's nice to

00:06:21

see and we have other values in general

00:06:23

because we have a program process that

00:06:26

changes with it does not cancel that's important

00:06:29

therefore we are sure to print oh

00:06:32

do everything exactly the same and everything will be

00:06:35

cool

00:06:38

friends in this sample everything is exactly the

00:06:40

same then here the program is just a

00:06:43

little different you see 10 a little bit the numbers

00:06:45

are changed here we just have a default here

00:06:49

we actually here we have die fahne

00:06:55

here it’s actually much simpler again,

00:06:58

the whole program will come out 4, that is, you insert everything the same way

00:07:00

as I did and plus

00:07:05

the score is guaranteed for you all, thank you for

00:07:07

watching if you want, like everyone

00:07:09

real bye everyone

Description:

Спасибо за просмотр :) Если есть вопросы - пишите комментарии! Что нужно вставлять в задание 6: for i:= 1 to 1000 do begin (тут сама программа-задание) end;

Preparing download options

Popular

HD video

Only sound

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

How can I download "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ" video?

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.

Which format of "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ" video should I choose?

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.

Why does my computer freeze when loading a "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ" video?

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.

How can I download "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ" video to my phone?

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.

How can I download an audio track (music) to MP3 "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ"?

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.

How can I save a frame from a video "БЫСТРОЕ РЕШЕНИЕ 6 ЗАДАНИЯ ЕГЭ Информатика 2021 на ЛЮБОМ ЯЗЫКЕ"?

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.

What's the price of all this stuff?

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.