There are no changes in KIM USE 2020 in informatics and ICT.

The examination paper consists of two parts, including 27 tasks.

• Part 1 contains 23 tasks with a short answer. Answers to tasks 1-23 are written as a number, a sequence of letters or numbers.
• Part 2 contains 4 tasks with a detailed answer. Tasks 24–27 require a detailed solution.

All USE forms are filled in with bright black ink. You can use a gel or capillary pen. When completing assignments, you can use a draft. Entries in the draft, as well as in the text of the control measuring materials, are not taken into account when evaluating the work.

3 hours 55 minutes (235 minutes) are allotted to complete the examination paper in informatics and ICT.

The points you get for completed tasks are summed up. Try to complete as many tasks as possible and score the most points.

Points for tasks in computer science

1 point - for 1-23 tasks
2 points - 25.
3 points - 24, 26.
4 points - 27.

Total: 35 points.

At the end of August, demonstration versions of the KIM USE 2019 were published on the official website of the FIPI (including the demonstration version of the USE in informatics).

For graduates of great interest are the documents that regulate the structure and content of KIM - the codifier and specification.

USE in Informatics 2019 - demo with answers and criteria from FIPI

Changes in KIM 2019 compared to KIM 2018.

The KIM model of 2019 will not change compared to 2018. The number of tasks, their difficulty levels, the elements of content and skills to be tested, and the maximum scores for completing tasks will remain the same as in 2015–2018.

Structure of KIM USE

Each version of the examination paper consists of two parts and includes 27 tasks that differ in form and level of complexity.

Part 1 contains 23 short answer tasks. In the examination work, the following types of tasks with a short answer are proposed: - tasks for calculating a certain value; - tasks to establish the correct sequence, presented as a string of characters according to a certain algorithm.

The answer to the tasks of part 1 is given by the corresponding entry in the form of a natural number or a sequence of characters (letters or numbers) written without spaces and other separators. Part 2 contains 4 tasks with a detailed answer.

Part 1 contains 23 tasks of basic, advanced and high difficulty levels. This part contains tasks with a short answer, implying independent formulation and recording of the answer in the form of a number or sequence of characters. Tasks check the material of all thematic blocks. In part 1, 12 tasks are related to the basic level, 10 tasks are to an increased level of complexity, 1 task is to a high level of complexity.

Part 2 contains 4 tasks, the first of which is of an increased level of complexity, the remaining 3 tasks are of a high level of complexity. The tasks of this part involve writing a detailed answer in an arbitrary form.

The tasks of part 2 are aimed at testing the formation of the most important skills for recording and analyzing algorithms. These skills are tested at advanced and high difficulty levels. Also, at a high level of complexity, skills on the topic "Programming Technology" are checked.

The duration of the exam in informatics and ICT

3 hours 55 minutes (235 minutes) are allotted to complete the examination paper. It is recommended to take 1.5 hours (90 minutes) to complete the tasks of Part 1. The rest of the time is recommended to be devoted to the tasks of part 2.

Demonstration versions of the Unified State Examination in Informatics for Grade 11 for 2004 - 2014 consisted of three parts. The first part included tasks in which you need to choose one of the proposed answers. The tasks from the second part were required to give a short answer. To the tasks from the third part it was necessary to give a detailed answer.

In 2013 and 2014 in demo versions of the exam in computer science the following changes:

• was in the second part of the work.

In 2015 in demo in informatics was variant structure changed and optimized generally:

Option became be in two parts(part 1 - short answer questions, part 2 - ).

Numbering assignments has become through throughout the variant without letter designations A, B, C.

Was the form of recording the answer in tasks with a choice of answers has been changed: the answer has become necessary to write down the number with the number of the correct answer (and not mark with a cross).

It was reduced the total number of tasks (from 32 to 27); It was reduced from 40 to 35 maximum amount primary points.

The reduction in the number of tasks was made due to enlargement of the subjects of assignments, information related to the subject and complexity of tasks in one position. Such enlarged positions became: No. 3 (storage of information in a computer), No. 6 (formal execution of algorithms), No. 7 (technology for computing and visualizing data using spreadsheets) and No. 9 (transfer rate of sound and graphic files). AT demo 2015 presented several examples of each of tasks 3, 6, 7 and 9. In real options for each of these positions only one exercise.

• Was quest sequence changed.
• The part of the work that contained open-ended questions, hasn't changed.

AT demo version of the Unified State Examination in Informatics 2016 compared to the 2015 computer science demo no significant changes: only the sequence of tasks 1-5 has been changed.

AT demo version of the Unified State Examination in Informatics 2017 compared to the 2016 computer science demo there were no changes.

AT demo version of the USE 2018 in informatics compared to the 2017 demo in Informatics, the following changes were made: changes:

In task 25 removed possibility writing an algorithm in natural language,

• Examples texts of programs and their fragments in the conditions of tasks 8, 11, 19, 20, 21, 24, 25 in C language are replaced by C++ examples.

AT demo versions of the USE 2019-2020 in computer science compared to the 2018 computer science demo there were no changes.

Task 2. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Boolean function F given by the expression ¬x ∨ y ∨ (¬z ∧ w).
The figure shows a fragment of the truth table of the function F, containing all sets of arguments for which the function F is false. Determine which column of the truth table of the function F corresponds to each of the variables w, x, y, z.

Write the letters in your answer. w, x, y, z in the order in which the columns corresponding to them go (first - the letter corresponding to the first column; then - the letter corresponding to the second column, etc.) Write the letters in the answer in a row, you do not need to put any separators between the letters.

Task 3. Demo version of the Unified State Examination 2018 Informatics (FIPI):
In the figure on the right, the road map of the N-sky district is shown as a graph, the table contains information about the length of each of these roads (in kilometers).

Since the table and the diagram were drawn independently of each other, the numbering of settlements in the table is in no way connected with the letter designations on the graph. Determine the length of the road from the point BUT to paragraph G. In your answer, write down the whole number - as it is indicated in the table.

4 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):
Below are two fragments of tables from the database of residents of the microdistrict. Each row of table 2 contains information about the child and one of his parents. The information is represented by the value of the ID field in the corresponding line of Table 1. Based on the given data, determine how many children had mothers over 22 full years at the time of their birth. When calculating the answer, consider only information from
the given fragments of the tables.

5 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):
Encrypted messages containing only ten letters are transmitted over the communication channel: A, B, E, I, K, L, R, C, T, U. An uneven binary code. Code words are used for nine letters.


Specify the shortest code word for the letter B, under which the code will satisfy the Fano condition. If there are several such codes, indicate the code with least numerical value.

6 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):
The input of the algorithm is a natural number N. The algorithm builds a new number based on it R in the following way.

1. A binary notation of a number is being built N.

2. Two more digits are added to this entry on the right according to the following rule:

- add up all the digits of the binary notation of the number N, and the remainder after dividing the sum by 2 is added to the end of the number (on the right). For example, the entry 11100 converted to record 111001 ;

- the same actions are performed on this record - the remainder of dividing the sum of its digits by 2 is added to the right.

The record obtained in this way (it contains two digits more than in the record of the original number N) is a binary record of the desired number R.
Enter the minimum number R, which exceeds the number 83 and can be the result of this algorithm. Write this number in your answer. decimal system reckoning.

7 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):
A fragment of a spreadsheet is given. From cell B3 into a cell A4 formula has been copied. When copying the addresses of the cells in the formula, they automatically changed. What is the numeric value of the formula in the cell A4?


Note: The $ sign denotes absolute addressing.

8 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Write down the number that will be printed as a result of the following program. For your convenience, the program is presented in five programming languages.

var s, n: integer; begin s:= 260; n:=0; while s > 0 do begin s:= s - 15; n:= n + 2 writeln(n) end.

9 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Automatic camera produces bitmaps size 640 × 480 pixels. In this case, the size of the file with the image cannot exceed 320 KBytes, data packing is not performed. Which maximum amount colors can be used in the palette?

10 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

All 4-letter words made up of letters D, E, To, O, R, are listed in alphabetical order and numbered starting with 1 .
Below is the beginning of the list.

1. DDDD 2. DDDE 3. DDDD 4. DDDO 5. DDDR 6. DDED …

What is the first word in the list that starts with a letter? K?

11 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Below, a recursive algorithm is written in five programming languages F.
Pascal:

procedure F(n: integer); begin if n > 0 then begin write(n); F(n - 3); F(n div 3) end end;

Write down in a row without spaces and separators all the numbers that will be printed on the screen when making a call F(9). The numbers must be written in the same order in which they are displayed on the screen.

12 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

In TCP/IP networking terminology, a netmask is a binary number, which determines which part of the IP address of a network host refers to the network address, and which part refers to the address of the host itself in this network. Usually, the mask is written according to the same rules as the IP address - in the form of four bytes, with each byte written as decimal number. At the same time, in the mask, first (in the highest digits) there are ones, and then from a certain digit - zeros.
The network address is obtained by applying a bitwise conjunction to the given host IP address and mask.

For example, if the host IP address is 231.32.255.131 and the mask is 255.255.240.0, then the network address is 231.32.240.0.

For host with IP address 57.179.208.27 network address is 57.179.192.0 . What is greatest possible number units in the ranks of the mask?

13 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

When registering at computer system Each user is given a password consisting of 10 characters. Capital letters of the Latin alphabet are used as symbols, i.e. 26 various symbols. In the database, each password is stored with the same and the smallest possible integer byte. In this case, character-by-character coding of passwords is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in bytes) required to store data about 50 users. In the answer, write down only an integer - the number of bytes.

14 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the command move to (a, b), where a, b are integers. This command moves the Painter from the point with coordinates (x,y) to the point with coordinates (x + a, y + b).

The draftsman was given the following algorithm to execute (the number of repetitions and the magnitude of the offset in the first of the repeated commands are unknown):

START move by (4, 6) REPEAT… ONCE move by (…, …) move by (4, -6) END REPEAT move by (-28, -22) END

As a result of executing this algorithm, the draftsman returns to starting point. Which greatest the number of repetitions could be indicated in the construction "REPEAT ... ONCE"?

15 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

The figure shows a diagram of roads connecting cities A, B, C, D, D, E, G, H, I, K, L, M.
On each road, you can only move in one direction, indicated by the arrow.
How many different ways are there from the city BUT in town M passing through the city AND?

16 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

The value of the arithmetic expression: 49 10 + 7 30 – 49 - written in a number system with a base 7 . How many digits 6 » contained in this entry?

17 task. Demo USE 2018 Informatics (FIPI):

In the search engine query language to denote logical operation « OR» symbol is used « | ", and to denote the logical operation " And" - symbol " & ».

The table shows queries and the number of pages found by them for a certain segment of the Internet.

How many pages (in hundreds of thousands) will be found for the query Butterfly & Caterpillar?
It is assumed that all requests were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the requests.

18 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

For what is the largest integer BUT formula

identically true, that is, it takes the value 1 for any integer non-negative x and y?

19 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

The program uses a one-dimensional integer array A with indices from 0 before 9 . The element values ​​are 3, 0, 4, 6, 5, 1, 8, 2, 9, 7 respectively, i.e. A=3, A=0 etc.

Determine the value of a variable c after executing the following fragment of this program:

c:=0; for i:= 1 to 9 do if A > A[i] then begin c:= c + 1; t:= A[i]; A[i] := A; A := t; end;

20 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

The algorithm is written in five programming languages ​​below. Having received a number x, this algorithm prints two numbers: L and M. Enter the smallest number x, upon input of which the algorithm prints first 5 , and then 7 .

var x, L, M: integer; begin readln(x); L:= 0; M:= 0; while x>0 do begin M:= M + 1; if x mod 2<>0 then L:= L + 1; x:=x div 2; end; writeln(L); writeln(M); end.

21 tasks. Demo version of the Unified State Examination 2018 Informatics (FIPI):

Write in the answer the number that will be printed as a result of the following algorithm.

Pascal:

var a, b, t, M, R:longint; function F(x: longint): longint; begin F:= 2*(x*x-1)*(x*x-1)+27; end; begin a:=-20; b:=20; M:=a; R:=F(a); for t:= a to b do begin if (F(t)<= R) then begin M:=t; R:=F(t) end end; write(M+R) end.

22 task. Demo USE 2018 Informatics (FIPI):

Performer M17 converts the number written on the screen.
The performer has three teams that are assigned numbers:
1. add 1
2. add 2
3. multiply by 3

The first of them increases the number on the screen by 1, the second increases it by 2, the third multiplies by 3. The program for the M17 performer is a sequence of commands.

How many programs exist that convert the original number 2 in number 12 and the trajectory of the program's calculations contains the numbers 8 and 10 ? The trajectory must contain both specified numbers.

The trajectory of program computations is the sequence of results of execution of all program commands. For example, for program 132, with the initial number 7, the trajectory will consist of the numbers 8, 24, 26.

Solution 23 tasks of the exam in informatics demo version 2018 FIPI:

How many different sets of boolean values ​​are there x1, x2, … x7, y1, y2, … y7 that satisfy all of the following conditions?

(¬x1 ∨ y1) → (¬x2 ∧ y2) = 1
(¬x2 ∨ y2) → (¬x3 ∧ y3) = 1
…
(¬x6 ∨ y6) → (¬x7 ∧ y7) = 1

As an answer, you need to indicate the number of such sets.

Solution 24 task of the exam in informatics demo version 2018 FIPI:

A natural number not exceeding 10 9 . We need to write a program that displays the maximum digit of a number that is a multiple of 5. If there are no digits in the number that are multiples of 5 , it is required to display NO. The programmer wrote the program incorrectly. Below this program for your convenience is given in five programming languages.
Reminder: 0 is divisible by any natural number.
Pascal:

var N, digit, maxDigit: longint; begin readln(N); maxDigit:= N mod 10; while N > 0 do begin digit:= N mod 10; if digit mod 5 = 0 then if digit > maxDigit then maxDigit:= digit; N:= N div 10; end; if maxDigit = 0 then writeln("NO") else writeln(maxDigit) end.

Do the following in sequence:
1. Write what this program will display when you enter a number 132 .
2. Give an example of such a three-digit number, when you enter
The program gives the correct answer.
3. Find all errors in this program (there may be one or more). It is known that each error affects only one line and can be fixed without changing other lines. For each error:
1) write out the line where the error was made;
2) indicate how to fix the error, i.e. bring correct option lines.
It is enough to indicate the errors and the way to correct them for one programming language.

Solution 25 of the USE task in informatics Demo version 2018:

Given an integer array of 30 elements. Array elements can take integer values ​​from 0 before 10000 inclusive. Describe in one of the programming languages ​​an algorithm that finds the number of elements of an array greater than 100 and wherein multiples of 5, and then replaces each such element with a number equal to the number found. It is guaranteed that there is at least one such element in the array. As a result, you need to display the modified array, each element of the array is displayed on a new line.

For example, for an array of six elements: 4 115 7 195 25 106
the program should output the numbers: 4 2 7 2 25 106

The initial data is declared as shown below in examples for some programming languages. It is forbidden to use variables not described below, but it is allowed not to use some of the variables described.

Pascal:

const N = 30; var a: array of longint; i, j, k: longint; begin for i:= 1 to N do readln(a[i]); ... end.

As an answer, you need to give a fragment of the program, which should be in place of the ellipsis. You can also write the solution in another programming language (indicate the name and version of the programming language used, for example Free Pascal 2.6). In this case, you must use the same initial data and variables that were proposed in the condition.

Analysis of the 26 task of the demo version of 2018 (FIPI):
Two players, Petya and Vanya, play the following game. There is a pile of stones in front of the players. Players move in turn, Petya makes the first move. In one move, the player can add to the pile one stone or increase the number of stones in the pile twice. For example, having a pile of 15 stones, in one move you can get a pile of 16 or 30 stones. Each player has an unlimited number of stones to make moves.

The game ends when the number of stones in the pile becomes at least 29. The winner is the player who made the last move, that is, the first to receive a pile containing 29 or more stones. At the initial moment, there were S stones in the pile, 1 ≤ S ≤ 28.

We will say that a player has a winning strategy if he can win for any moves of the opponent. To describe a player's strategy means to describe what move he must make in any situation that he may encounter under different game enemy. To the description of the winning strategy it does not follow include the moves of the player playing according to this strategy, which are not unconditionally winning for him, i.e. not being winning regardless of the opponent's game.

Exercise 1
a) Indicate such values ​​of the number S for which Petya can win in one move.
b) Indicate a value of S for which Petya cannot win in one move, but for any Petya's move Vanya can win with his first move. Describe Vanya's winning strategy.

Task 2
Indicate two such values ​​of S for which Petya has a winning strategy, moreover:
- Petya cannot win in one move;
— Petya can win with his second move, regardless of how Vanya moves.
For the indicated values ​​of S, describe Petya's winning strategy.

Task 3
Specify the value of S at which:
- Vanya has a winning strategy that allows him to win on the first or second move in any game of Petya;
- Vanya does not have a strategy that will allow him to win with a guarantee on the first move.

For the given value of S, describe Vanya's winning strategy. Construct a tree of all games possible with this winning strategy (in the form of a figure or a table). On the edges of the tree indicate who makes the move; in knots - the number of stones in a position

The tree should not contain games that are impossible for the winning player to implement his winning strategy. For example, the complete game tree is not a valid answer for this task.

Analysis of the 27 tasks of the demo version of 2018 (FIPI):

The input of the program is a sequence of N positive integers, all numbers in the sequence are different. All couples are considered. various elements sequences (the elements of a pair do not have to be side by side in the sequence, the order of the elements in the pair is not important). Need to define the number of pairs for which the product of elements is divisible by 26 .

Description of input and output data The first line of the input data specifies the number of numbers N (1 ≤ N ≤ 1000). In each of the subsequent N lines contains one positive integer not exceeding 10 000 .
As a result, the program should print one number: the number of pairs in which the product of elements is a multiple of 26.

Input example:

4 2 6 13 39

Example output for the example input above:

From the four given numbers, you can make 6 pairwise products: 2 6 = 12 2 13 = 26 2 39 = 78 6 13 = 78 6 39 = 234 13 39 = 507

Of these, 4 works are divided into 26:

2 13=26; 2 39=78; 6 13=78; 6 39=234

It is required to write a time-efficient and memory-efficient program for
solution of the described problem.

-> demo USE 2018