Scho means in the 6th department of the OGE informatics. Topic: "Victory and analysis of simple algorithms"

In this video, the solution to the fast OGE s informatics... The positioning of the main accent is shown in the form of varto beastly respect, but it is not so important.


See options for the viconau chair, Yakі nybіlsh often take part in examinations informatics... In practice, it is shown that there are three simple and intelligent actions for help.


All three images are shown in detail with the explanations.


Perche zavdannya є classic for given zavdannya... The main understanding is introduced with details in it, and it is also shown how efficiently and quickly fit into it.

Another zavdannya is seen from the first individual. This kind of thinking is as close as possible to the atmosphere of real sleep and additional help in intelligence, as it is specifically necessary to develop, so that you can score a memorable ball.

The third plant can be brought up to a non-standard one, if all the techniques and methods are overwhelmed.

To consolidate the material covered do not forget to try the online test system on my site! Sent to video

Happy spirits!

Rosebir 6 zavdannya ЄDI 2017 rock for informatics from the demo project. The price of the basic level of folding. Approximate hour of the day is 4 hvilini.

To revise the elements of the zmist: formally a submission to the algorithm written in the natural language or in the context of a linear algorithm for a formal submission with a set of commands. Elementy zmistu, transformed into ЄDI: Formalization of the understanding of the algorithm. Pobudova algorithm and practical calculation.

Zavdannya 6:

The automaton will cancel a three-digit number for input. On the third day there will be a new number following such rules.
1. The first and the other, as well as the friend, and the third digit of the entry number.
2. Otrimanі two numbers are written down one by one in the order of uduvannya (without distributions).
Butt. Cob number: 348. Sumi: 3 + 4 = 7; 4 + 8 = 12. Result: 127.
vkazhit the least number, in the result of processing which automaton there is the number 1711.

View: ________

Rosebir 6 zdannya ЄDI 2017:

Obviously, the result is 1711 Wiishov from two numbers 17 and 11.

Now we know the least three-digit number.

So, if the shuka is the smallest number, then we will fix it with the smallest sum (11), then I will correct the first number.

11 - 9 = 2. In this rank, the number 11 is entered yak sum 2 і 9: 2 + 9 = 11 .

Number 17 go yak sum 9 and 8: 9 + 8 = 17 .

Now the shukane is the smallest three-digit number, and I can accept it as 298.

Reversion 2 + 9 = 11 і 9 + 8 = 17

Methodical article: Decision of A6 (Algorithm for a specific visitor with a fixed set of commands) of the main sovereign sleep in the 9th class (OGE) using the mathematical apparatus.

describe material : Statistical representations have a way of verifying the A6 main state policy (OGE) in informatics by means of a mathematical apparatus.

Yak option, daniy way of learning can be found in the integrated level of geometry and informatics in the 9th grade with the education in geometry by those "Suma kutivn-golіka ", and from informatics with those" Algorithms "on the application of the" Promisloviy designer "vikonavtsya.

It is necessary to give a geometrical course for the finalization of the study.

    Shho also opuky and uvignuy n -gon, yak n - the corner is called correct, as well as lamana line.

    opucleusn-kutnik

    uvіgnutiyn-coal

    correctn-kutnik

    Lamana line

II. The theorem about the sum of kutiv of an opukly bagatokutnik

For the opuky n-kutnik suma kutіv dorіvnyuє 180 ° (n-2), den- number of sides / kutiv.

III.

Trikutnik - tse opucliy bagatokutnik.

At the tricot maker:

3 side and 3 kuta

Suma kutiv trikutnik dorivnyuє 180 about

sides of the rіvnі, kuti 60 each about

Tom scho:

60 about

And forn-gon

Zapam'ataєmo qiu formula!

The very manager of the A6 s KIMs of the main sovereign hospital s in informatics:

IV . zavdannya A6 The Vikonavets Turtle is moved to the computer screens, which are left behind by the viewer of the line. In the case of the skin, a specific moment is seen in the position of the visitor and directly to his ruku. The viconavtsya іsnu has two commanders:forward n (De n is a whole number), scho wiklikє oversubscribing Turtles on n crocs in a straight line;right m (De m is a whole number), which is a wicked change straight to the roof by m degrees behind the year's arrow. recordingRepeat k [command1 command2 command3] means that the sequence of the commands in the bows is repeated k times.

Turtle buv is given for the offensive algorithm:

Repeat 5 [Forward 80 Right 60] ... Yaka figura come to the screen?

1) the correct p'yatikutnik
2) correct tricycle
3) correct six-walker
4) open lamana line

Solution: Turtle has 2 commands:forward n , To the right m

The command is visibleForward 80 Right 60 pose in a loop і neatly:

Otzhe, in our office internal kutn- door 120 about

Vikoristovy for skin version of the following:

The lesson of assignments to that, yak virishuvati 6


The 6th topic - "Analysis of algorithms and viconavtsi" - be characterized as the standard of the basic level of folding, an hour of submission is approximately 4 chilini, the maximum score is 1

Viconavets for building in a square, delay, multiple and folding

Those who can be useful in the present for the release of the 6th edition are briefly discernible.

  • in tasks, for which it is necessary to all possible results robots to the algorithm of any visitor, it is possible to receive data from the changes and to calculate the algorithm with the changes;
  • in tasks, for which it is necessary to know optimal program(Anything short), and for the help of a given set of commands, I will re-create the number in іnshe, more beautifully for the version being a tree of junior options; in such a rank, numbered, such as the results and the result is to go for one crock, for two crocs, etc. As a result, there is a bedroom solution;
  • if the middle of the tasks in the headquarters of the viconavtsa teams is a non-negotiable command (for example, the viconavets pratsyuє with whole numbers and ), then tree options are more beautiful than buduvati z kintzya, Tobto in vortex order, Rukhayuchis from the end of the number to the cob; Once the number of cob numbers was recorded in the result, the sequence of the commands by the programs must be recorded from the cob count to the end number.

Reconstruction of the numerical sequence for the consistency of the algorithm

  • it is necessary to repeat the topic for the vikonannya of the workers;
  • the maximum value of the sum of the decimal digits - tse 18 so yak 9 + 9 = 18 ;
  • to verify the correctness of the required occasion, it is necessary to introduce bit parity- an additional bit, which can be added to the double code with such a rank, but as a result there are a number of guys: if there are some guys, then 0 will be added, and 1 will be unpaired:
for example: 3 10 = 11 2 for an additional pairing bit: 110 ---- 4 10 = 100 2 for an additional pairing bit: 1001,
  • adding up to dvіykovіy write the number zero to the right increase the number by 2 times:
  • for example: 111 2 - tse 7 10 dodamo 0 right handed: 1110 Otrimati 2 - tse 14 10

    Now we will look at specific types of examination options from computer science and explanations from the version.

    Rosebir 6 Zavdannya

    Rishennya zavdan 6 ЄDI z informatics for those Vikonavtsi

    6_1:

    The viconavets of the conic is alive on the number axis. Pochatkovo the position of the bunks - point 0 ... Conic command system:

    • forward 5- Konik stripє forward by 5 units,
    • back 3- Konik stripє back 3 units.

    yake the least a number of developments are guilty of the team's involvement in the program "Back 3", Schob conic emerged at the point 21 ?


    ✍ Decision:

    Two options are available.

    ✎ 1 option solution:

    • Introduced value:
      • hey x- the whole team forward 5
      • hey y- the whole team back 3
    • Oskilki Konik collapse on the cob of a number axis (s 0 ) І in the bag of the reach of the point 21 , That otrimaєmo rivnyannya:
    5x - 3y = 21 ( -3y- oskіlki ruhaєmosya back)
  • Visible x:
  • 5x = 21 + 3y
  • Schob visloviti x it is necessary to have the right to partly distribute 5 ... And oskіlki x can not be a shot number, then it is robotic to hang, but the right part is to blame for 5 without surplus.
  • Oskilki we need to give the least y, Then we will pick y, fixing it 1 :
  • y = 1-> 21 + 3 does not last 5 y = 2-> 21 + 6 does not last 5 y = 3 -> 21+9 last by 5

    result: 3

    ✎ 2 option solution:

    • Okay, Konik get to 21 (i dal). Win tse mig zrobiti tilki for the help of the command Forward 5. let's take a look numbers> 21і dividing by 5 without surplus(Tom scho forward 5).
    • The first number is greater 21 and last for 5 without surplus - tse 25 .
    25 - 3 (back 3) = 22 -> not 21 30 - 3 - 3 - 3 = 21 -> otrima 21!
  • With tsomu bula vikoristan team back 3 three razi.
  • result: 3

    I’m too impassive, I’m sure to wonder video with selection of solutions:


    6_2:

    Є viconavets Konik, who lives on a number axis. Grasshopper Command System:

    • ahead of N(Konik streibє forward by N one);
    • back M(Konik streibє back to M one).

    change Nі M You can take positive values.

    Vidomo, scho Konik vikonav program z 50 teams, in teams back 2 12 more, less teams forward 3... There were no other teams in the program.
    For yaku one command can be substituted for the program, so that Konik appears in the same point, what and when the program is displayed?


    ✍ Decision:
    • In order to know the number of both commands, you need to enter the wrong x... Clearly, many teams forward 3 bulo viconano x times, only a number of teams back 2 bulo x + 12 once. So yak all the teams bulo 50 If there weren't any teams, then it would be quite reasonable:
    x + x + 12 = 50 teams
  • we know x(Number of teams forward 3):
  • 2x = 50 - 12 x = 38/2 = 19
  • Now we know a point on the numerical axis, in which Konik is leaning. Vrahumo, scho vin 19 once you hit the strip three "crocs" forward i 19 + 12 once stripping back 2 crocs:
  • 3 * 19 - 2 * (19 + 12) = 57 - 62 = -5
  • -5 means that you can move to the point with one command - back 5
  • result: back 5

    Proponymously marvel at the revision of Zavdannya 6 on video:

    ЄDI 6_3:
    At the visonavts quadr two commanders who assigned telephone numbers:

    1. give 1,
    2. put it in a square.

    First of all commands increase the number on the screen by 1, the other - to square it. The program for the Viconavtsya Kvadr - the whole sequence of numbers of teams.

    Napryklad, 22111 - tse program vivedi in a square vivedi in a square dodai 1 add 1 dodai 1 qia program will rewrite the number 3 v 84 .

    Write a program for the visonavts quadr, Yaka will convert the number 5 into the number 2500 and take revenge no more 6 teams. If there are more than one such programs, then write down whether they are.


    ✍ Decision:
    • oskіlki number 2500 Chimala, to that, it is possible to “go” smoothly with the help of yak commands.
    • This kind of zavdannyakh has a great solution from the beginning - from the date 2500 square root of a number(To that, a square root is a squared operation). As the square root does not flare up, we will vikonuvat zorotnu command for the first command - virahuvali 1(Zvorotna for give 1):
  • 2500 : the square of the number 50 -> operation 2
  • 50 visit 1, Otrimaєmo 49 -> operation 1
  • 49 : the square of the number 7 -> operation 2
  • 7 : Not є squared, meaning team visit 1, Otrimaєmo 6 -> operation 1
  • 6 : Not є squared, meaning team visit 1, Otrimaєmo 5 -> operation 1
  • We can write down all the commands in the zorotny last and the result is visible:
  • result: 11212

    You can marvel at the video of the broadcast 6 of the ADI from Informatics:


    6_4. Option No. 11, 2019, Informatics and ICT Types of examination options, S. S. Krilov, T. Churkina

    At the visonavts calculator two commanders who assigned telephone numbers:

    1. give 3,
    2. Give it to 5.

    I will pick them up, the Calculator will add up to the number on the screen 3, and I will go to a friend, multiply it by 5.

    Write down the order of commands in the program, as I will rewrite number 3 to number 24 and no more revenge chotiroh teams. Enter the number of commands deprived.


    ✍ Decision:
    • For this kind of people, it’s simpler to pick up a solution from the beginning - from the date 24 , І kozhin times namagatisya viconati diyu divided by 5(That is why it is a lot of ringing operations). If we look at a number that does not differ in integer by 5, then we will send a signal to the command for the first command - virahuvali 3(Zvorotna for give it 3):
  • 24 : Do not last by 5 means 24 - 3 = 21 -> operation 1
  • 21 : Do not last by 5 means 21 - 3 = 18 -> operation 1
  • 18 : Do not last by 5 means 18 - 3 = 15 -> operation 1
  • 15 : 15 / 5 = 3 -> operation 2
  • We can write down all the commands in the zorotniy endowment and the result is acceptable: 2111.
  • as follows: 2111


    6_5:

    At the viconavtsya, which is a practice with positive one-byte two-byte numbers, two commands, which have assigned a telephone number:

    1. zrush to the right
    2. give it 4

    Viconuyuchi pershu from them, vikonavets destroy the number by one double row to the right, and vikonuyuchi to a friend, add to the new 4.

    Viconavets counting from number 191 і vikonav lantsyuzhok teams 112112 ... Record the result in dozens of numerical systems.


    ✍ Decision:

    ✎ 1 way:

    • For the vikonannya of the first command, we translate the number into a two-sided numerical system:
    191 10 = 10111111 2
  • team 1: Command zrush to the right means that the youngest bit will be "ruined" (to eat in the special edition - bit transferred), and in the older one - 0 (Yakiy є insignificant, which means you can not write).
  • 10111111 - > 1011111
  • team 1: Repeat diyu again at the forefront:
  • 01011111 - > 101111
  • team 2: I will give a command to a simpler viconati, exceeding the number in a dozen numerical systems:
  • 101111 2 -> 47 10
  • now dodamo 4 :
  • 47 + 4 = 51
  • team 1: I know it can be translated into a two-way system of numbers:
  • 51 10 = 110011 2
  • Viconaєmo ruin:
  • 110011 - > 11001
  • team 1: Viconaєmo ruinous again:
  • 11001 - > 1100
  • team 2: We translate the number into a dozen numerical system і dodamo 4 :
  • 1100 2 -> 12 10 12 + 4 = 16

    result: 16

    ✎ 2 ways:

    • When zsuvі to the right in the senior bit, you consume zero, and the youngest bit is directed in the special view - bit transferred, that is, E. Win will be "ruined". In such a rank, as the number of a guy, then when zsuvі it will change twice; if it is not paired, - the number will change two times as much as the number less than the guy 2 ).
    • Otrimaєmo results and display of the following commands:
    Team 1: 191 -> 95 Team 1: 95 -> 47 Team 2: 47 -> 51 Team 1: 51 -> 25 Team 1: 25 -> 12 Team 2: 12 -> 16

    result: 16

    Explained report to marvel on video:


    6_6: Head of 6 ЄDI from Informatics 2017 FIPI option 19 (Krilov S.S., Churkina T.Є.):

    The viconavtsya Adviser-Multiplier has two commands, who assigned telephone numbers:

    1. give it 3
    2. Give it to x

    The first of them is the higher number on the screen on 3 , I will multiply my friend on NS... The program for the viconavtsya is the end of the number of teams. Vidomo, scho program 12112 rewrite the number 3 in number 120 .

    Visnite value NS, Yaksho vіdomo, scho vono natural.

    ✍ Decision:

    • Commands are displayed in order in order with numbers in the order of the commands. For the sake of convenience, we will use the temples:
      12112 :
    ((((3 + 3) * x) +3) +3) * x = 120
  • Obsessed with being square:
  • 6x 2 + 6x - 120 = 0
  • Virishimo yogo and іtrimaєmo result:
  • x1 = 4; x2 = -60 / 12
  • So yak for zavdannyam NS- natural, then x2 we do not fit.
  • subdivisions x1 to our rivnyannya for conversion:
  • ((((3+3)*4)+3)+3)*4 = 120

    Everything is correct.

    result: 4

    You can marvel at the video of ADI from Informatics 2017 in more detail about the lesson:

    Rishennya zavdan for those Reversion of numerical endings (Automatic)

    6_7: ЄDI from computer science department 6 from the site of K. Polyakov (department number Р-06):

    The vending machine will change the number to input. On the third day there will be a new number following such rules.

    1. The first and second digits are added, as well as the third and fourth digits of the entry number.
    2. Otrimanі two numbers are written down one by one in the order of removal (without distributions).

    Butt. Cob number: 3165. Sumi: 3 + 1 = 4; 6 + 5 = 11. Result: 114.

    vkazhit the least the number, as a result of processing, there is a machine number 1311.


    ✍ Decision:

    result: 2949

    The process of displaying a given 6 views in a video:


    6_8: Head of 6 ЄDI from Informatics 2017 FIPI (Krilov S.S., Churkina T.Є.) Option 13:

    The vending machine will change to the input chotirynumeric number. There will be a new number according to the following rules:

    • The first and third digits are added, then the friend and the third, and then the third and fourth digits of the entry number.
    • Otrimanі three numbers are written down one by one in the order of growth (without razdіlnikіv).
    • butt: Cob number: 7531. Sumi: 7 + 5 = 12; 5 + 3 = 8; 3 + 1 = 4. Result: 4812.

    Insert the highest number in the processing results 2512 .


    ✍ Decision:

    result: 9320


    6_9: Head of 6 ЄDI from Informatics 2017 FIPI (Ushakov D.M.) option 2:

    The machine will deactivate two double-digit sixteen-digit numbers for input. All numbers have all numbers look for the number 6(Yaksho in the number є the figure is more than 6, the machine is considered pratsyuvati). For a number of numbers, a new number of sixteen will be used according to the following rules:

    1. Two sixteen numbers are counted - the sum of the senior ranks of the rim of the numbers and the sum of the youngest ranks of the cich numbers.
    2. Otrimanі two sixteen numbers are written down one by one in the order of uduvannya (without razdіlnikіv).
    3. butt: Widget numbers: 25, 66. To the bit size sumi: 8, B. Result: B8.

    Can it be the result of a robotic automaton?
    Rehash in alphabetical order the letters that match the numbers, without the breaks and the letters.

    options:
    A) 127
    B) C6
    C) BA
    D) E3
    E) D1


    ✍ Decision:

    result: BC

    A detailed solution of the given 6 factory can be viewed on the video:


    6_10: 6 zavdannya ЄDI. Zavdannya 4 GVE 11 class 2018 rik FIPI

    I will turn off the machine at the input two two-digit sixteen numbers... All numbers have all numbers look for the number 7(Yaksho in the number є the figure is more than 7, the automatic machine is considered pratsyuvati). For a number of numbers, a new number of sixteen will be used according to such rules.

    1. Two sixteen numbers are counted: the sum of the senior ranks from the rim of the numbers and the sum of the youngest ranks of the cich numbers.
    2. Otrimanі two sixteen numbers are written down one by one in the order of growth (without razdіlnikіv).

    Butt. Widget numbers: 66, 43. For a bit sumi: A, 9. Result: 9A.

    On the other hand, it can be the result of a robotic automaton, like the proponent numbers.

    options:
    1) AD
    2) 64
    3)CF
    4) 811


    ✍ Decision:

    result: 1

    Decision 4 head of the GVE class 11 to marvel at the video:

    Decision about the algorithm, what will be the number R

    6_11: Head of 6 ЄDI z Informatics 2017 FIPI option 2 (Krilov S.S., Churkina T.Є.):

    N R let's step in rank:

    1. 4N.
    • all the digits of the double record are stored, and the surplus of the sum on 2 to add to the end of the number (right-handed person). For example, write 10000 reimagine in the record 100001 ;
    • above the cim record, you can also use the same number - on the right, add an excess of the length of the sum of the digits on 2 .

    Otriman such an order of writing є dvіykovіy notation of the shukany number R.

    Add the lowest number N, For which the result of the robot and the algorithm is larger 129 . In general, the number should be recorded in dozens of numerical systems.


    ✍ Decision:
    • Amazingly, when you send a visit to another item, there will be only two numbers! Let's get the lowest number of guys that I can change. 129, є number 130 ... We will be successful with him.
    • translatable 130 in the dvіykov system of numbers:
    130 10 = 10000010 2
  • The number of two numbers went out from the two-way number, for that two numbers were added. 2 ... tobto.:
  • in ringing order: bulo 1000001 -> became 10000010 again the same: bulo 100000 -> became 1000001
  • It means that we need two numbers - tse 100000 .
  • translatable 100000 to the 10th system:
  • 100000 2 = 32 10
  • So yak for wash with us 4 * N, then 32 dimo on 4 — > 8 .
  • result: 8

    For a more detailed selection, you will be able to marvel at the video solution of the 6th department of ADI from Informatics:


    6_12: 6 zavdannya. Demo version of ADI 2018 Informatics:

    The input to the algorithm is a natural number N... The algorithm will be based on a new number R let's step up the rank.

    1. There will be a double record of the number N.
    2. Until then, I will write down two more rows on the right, following the following rule:
    3. all digits of the two-way record of the number are stored N, І surplus from the sum of the sum by 2 to be added to the end of the number (right-handed). For example, write 11100 reimagine in the record 111001 ;
    4. over the tsim record, the same goes - on the right, add the surplus of the sum of the digits by 2.
    5. Otriman with such a rank of entry (in nіy two more ranks, lower in the notation of the cob number N) є two-way notation of the shukany number R.

      Enter the minimum number R, Yake will change the number 83 and may be the result of a robotic algorithm. In general, the number should be recorded in dozens of numerical systems.


    ✍ Decision:
    • It’s great that for another item, you must include only pairs of numbers (that’s also the number in two systems ends in 0 , That’s the guy). Such a rank, we will be tsіkaviti only pairs of numbers.
    • The smallest number that I can change 83, є number 84 ... We will be successful with him.
    • translatable 84 in the dvіykov system of numbers:
    84 = 10101 00
  • N 10101 ... If the first point was given up to the given date, the blame was made on the right one, so it’s unpaired. A mi maєmo 0 ... Apparently, it’s not okay.
  • The number of guys is coming - 86 ... We can translate it into a two-sided numerical system:
  • 86 = 10101 10
  • In this number, a part is seen - tse N... It means that we need two numbers - tse 10101 ... For the first time to the given date, the bullet is guilty to the right odinitsa, So i є: 10101 1 ... And then get ready 0 : 1010110 ... Apparently, it's okay.
  • result: 86

    Detailed solution of the given 6 test from the demo version of ADI 2018 to marvel at the video:


    6_13: Rosbir 6 zavdannya ЄDІ option No. 1, 2019 Informatics and ICT Types of examination options (10 options), S.S. Krilov, tobto Churkina:

    The input to the algorithm is a natural number N... The algorithm will be based on a new number R let's step in rank:

    1. There will be a double record of the number N.
    2. Until then, I will write down two more rows on the right, following the following rule:
    - yaksho N last without residue 4 zero, And then another zero;
    - yaksho N in case of growth 4 yesє to excess 1 zero, and then odinitsa;
    - yaksho N in case of growth 4 yesє to excess 2 , Then at the end of the number (right-handed person) add the spatka one, and then zero;
    - yaksho N in case of growth 4 yesє to excess 3 , In the end of the number (right-handed), add the list one, And then another odinitsa.

    For example, the double entry 1001 of the number 9 will be transformed into 100101, and the double entry 1100 of the number 12 will be transformed into 110000.

    Otriman such a rank of entry (in nіy two orders more, nіzh in the notation of the cob number N) Є double notation of the number R- the result of the robot given to the algorithm.

    Add maximum number R, yake less than 100 and may be the result of a robotic algorithm. Write down the number in dozens of numerical systems.


    ✍ Decision:
    • If you need to know the largest number, then the most possible number, such as - the whole number 99 ... We can translate it into a two-way system:
    99 = 1100011 2
  • Following the algorithm, the number went down the path to the right of two lines, the meaning of which was N:
  • 11000 11 N
  • Tobto in kіntsі bouly dodanі dvі odinitsі - for the algorithm of price meaning, N may be surplus if there is a 4 dawati 3 ... We can translate N in the tens system:
  • 11000 = 24 10
  • 24 last for 4 ostachi, so that in the beginning, the algorithm for blaming the bully will be given two discharges - 00 ... We have in kіntsі 11 ... Tobto number 99 do not go. Perevirimo offensive - 98 .
  • 98 = 11000 10 2: 10 in the beginning is given by the algorithm N = 11000 2 = 24 10 24 it lasts without the remainder of 4. According to the algorithm in the beginning it is 00 , And mi maєmo 10 98 - do not go 97 = 11000 01 2: 01 in the end is given by the algorithm N = 11000 2 = 24 10 24 to continue without the remainder by 4. According to the algorithm, in the end 00 , And mi maєmo 01 97 - do not go 96 = 11000 00 2: 00 in the beginning is given by the algorithm N = 11000 2 = 24 10 24 to last without the remainder of 4. According to the algorithm in the beginning it is 00 , We have 00 - vіrno! 96 - go!

    result: 96

    Take a look at the video of the solution: