A real option for an early exam in computer science. Online Unified State Exam tests

Today, the importance of knowledge of computer science and the ability to work on a computer is beyond doubt, because computer technology has penetrated into all spheres of life and industries. national economy. Without them it is impossible modern medicine, construction, industry, transport logistics and even competent management farming.

The Unified State Examination in computer science is included in the category of selective exams and is required if you intend to study information security, programming, nanotechnology, construction of missile systems, nuclear physics, master automation and control or system analysis. Some students mistakenly believe that anyone who knows how to work on a computer can pass this test.

Quite a few high school students have already gotten caught in this. But computer science requires not just memorization of terminology and skills in working with familiar software, but also knowledge of the basics of programming, good mathematical training and developed logical thinking. For successful completion Unified State Exam 2017 you need to familiarize yourself with possible changes in CIMs, find out the structure and content exam card, as well as the timing of this Unified State Examination. Let's look at each of these questions.

Demo version of the Unified State Exam-2017

Unified State Exam dates in computer science and ICT

This subject can be taken on one of the dates determined by Rosobrnadzor:

• Early period. On May 29, 2017, those who are eligible to write computer science ahead of schedule will take the exam. Let us remind you that graduates of previous years, students who studied at evening school, participants in international and All-Russian Olympiads, competitions and sports competitions, schoolchildren who have decided, children in need of treatment or rehabilitation, and those who are going to continue their studies at foreign universities. To obtain such a privilege, you need to write an application in the prescribed form on time (before March 1). In addition, April 5, 2017 is named as a reserve date in case of force majeure;
• Main stage. On June 9, 2017, the majority of graduates will take the exam in computer science and ICT.
• Reserve date. Two reserve dates have been identified: June 20 (for computer science and ICT) and June 30 for all subjects.

Statistical information

As practice shows, not many graduates want to try their hand at computer science. For example, in 2016, 64 thousand people (approximately 5% of schoolchildren) chose this subject. However, popularity computer technology is increasing every year - in 2015, slightly less than 52 thousand graduates decided to take this Unified State Exam.

As already mentioned, this Unified State Exam cannot be called easy. This is evidenced by the fact that in 2015 and 2014 minimum threshold 10.4 and 16.2% of schoolchildren, respectively, failed to pass, and about 14 thousand students did not come to the exam at all, having encountered difficulties in preparation. The average score is estimated at 53.6, which can be equated to the mark “3”, and the number of eleventh graders knowledgeable in computer science for the maximum one hundred points, amounted to 129 people in 2015.

What can you take for the Unified State Exam in computer science?

It is worth saying once again that the Unified State Exam in computer science does not imply the use of additional reference materials And computer technology, including calculators. During the exam it is forbidden to talk, turn around or get up from your seat. You can go to the restroom or first aid station, but you must notify the supervisor who will accompany you to your destination.

Do not try to bring a smartphone, tablet, smart watch, Bluetooth headphones and other audio and video equipment with you, as they will still be detected by the metal detector frame. Do not put yourself at risk of being removed from the exam, because in 2015 alone, 1,124 schoolchildren were removed from the Unified State Exam for violating the rules and regulations. Fraud will deprive you of your opportunity!

Structure of the Unified State Examination in computer science and ICT

The examination in this subject will test graduates’ theoretical knowledge in computer science and their skills in working with information and computer technology. In particular, the student will be required to demonstrate logical thinking, skills in algorithmization, programming, modeling and conducting computer experiments, knowledge of telecommunications technologies, as well as abilities in storing, searching and sorting data. KIMs in computer science consist of 27 tasks, combined into two parts:

• the first part includes 23 tasks requiring a short answer in the form of sequentially written letters or numbers;
• the second part consists of 4 tasks that need to be answered in a detailed form.

Let us remind you that since last year all tickets were excluded simple types tasks. Specialists from the company decided to leave only tasks in the CMMs that fall into the category of complex and higher level complexity. In total, 235 minutes are allotted for performing CMMs.

Assessing the Unified State Examination in computer science

According to latest information, it is quite possible that in 2017 the practice of transferring Unified State Exam scores to five-point system, and the examination results will have an impact on the certification grade. There is no reliable and unambiguous information on this issue yet, but for general guidance we will provide a system for converting points into grades.

• From 0 to 39 points - a sign of unsatisfactory knowledge at the level of mark “2”;
• From 40 to 55 points – satisfactory knowledge, points are identical to the grade “3”;
• From 56 to 72 points show a good level of knowledge and skills in this subject, which means your score is “4”;
• 73 or more points mean excellent knowledge, and the student deservedly receives a “5”.

Let us remind you that you can find out your exam scores at the announced time by registering for Unified State Exam portal. To identify your identity, you will need to enter your passport information.

Preparation for the Unified State Exam in computer science

It is much easier to prepare for computer science if you focus on demo versions of 2017 CMMs, which can be downloaded on our website (see the beginning of the article). These ticket options were developed by specialists from Federal Institute pedagogical dimensions who are also responsible for real tasks for the Unified State Exam. Of course, the tasks will not be 100% identical, but the themes and structure will be identical to the demo version.

Russian language

Literature

Informatics

Biology

Social science

English language

Geography

State Examination Subjects 2019

Mathematics

Russian language

Literature

Biology

Social science

Geography

Foreign languages

General information about the Unified State Exam 2018

Unified State Exam 2018– mandatory final certification 11th grade students. Not only grades in the certificate, but also successful admission to a university depend on its results.

How to pass exams high score? To do this, students need to determine their professional priorities as early as possible and develop effective plan preparation for the Unified State Exam in compulsory subjects, as well as disciplines required for enrollment in the chosen faculty. Deepening theoretical knowledge and permanent practical exercises is the key to successfully completing school and receiving a high-quality professional education.

Portal website will help you get everything necessary information about exams. On its pages, graduates can find out:

• test structure;
• form of assignments;
• effective preparation strategies;
• additional materials permitted for use in the exam;
• test evaluation criteria and score conversion scale;

Detailed description of the test for each subject and statistics Unified State Exam results past years will help students objectively assess the complexity of the work and correctly distribute efforts to study all the necessary disciplines.

The site also contains materials for preparation for the unified state exam 2019:

• practical tasks;
• lecture courses;
• essays;
• crib sheets.

Students can download solutions tests and demo versions compiled in accordance with FIPI requirements for exam KIMs. The tasks that are included in them are similar to those that may appear on the Unified State Exam. Thanks to this, graduates have the opportunity to test their knowledge at all stages preparatory work, and also learn how to quickly and correctly fill out forms.

Online Unified State Exam tests

Online testing is a virtual demo version Unified State Exam. Options are generated from the bank exam tasks, developed by FIPI. Today it contains about 80 thousand questions in each discipline.

Unified State Exam online– the best option for preparatory work for those who have constant access to the Internet. Virtual testing has no time limit. Graduates can choose a training regimen that suits their level of knowledge and goals:

• skip difficult tasks;
• check answers;
• solve tests online selectively in random order.

When working with demo versions, do not forget that they do not include some exam topics. To avoid troubles in the exam and get a high score, you need to study all the questions provided by the FIPI codifiers. They will help with this school books, consultations with teachers and a website that will tell you about traps of the Unified State Exam 2019.

About the Unified State Examination subject: computer science

Vyacheslav Leshchiner, a leading researcher at the Federal State Budgetary Institution "FIPI", spoke about preparation for computer science.

Unified State Examination in computer science in 2017

Compared to others Unified State Exam subjects in computer science is the most conservative exam, because its structure has remained virtually unchanged from the very beginning. So demo version of the Unified State Exam in computer science 2017 is extremely similar to earlier CMMs. There are still minor changes, and they relate to the order of presentation of the first five tasks (more detailed information is presented in the table).

No changes have been made to the question structure and codifier.

Table. Correspondence of Unified State Examination tasks in computer science 2016 and 2015.

20162015

Task 1Task 4

Task 2Task 2

Task 3Task 5

Task 4Task 3

Task 5Task 1

Task structure

Exam options consist of 27 tasks of varying complexity(basic, advanced, high), divided into two parts.

Part 1 consists of 23 short answer questions. Of these, 12 tasks relate to basic level knowledge, 10 – to advanced and one – to high. The answer to the tasks of the first part is written as a sequence of numbers and letters in two places: in the answer field in the KIM text and in the corresponding line of answer form No. 1.

Part 2 consists of four tasks for a detailed solution (one advanced-level question and three high-level questions). Solutions to 24-27 tasks are written down in full on answer form No. 2. If necessary, an additional sheet is issued.

Schoolchildren without academic debts who have fully mastered the information provided in the curriculum. Annual grades in the secondary (complete) education program must be positive (above a two).

The following can voluntarily take the Unified State Exam:

students with disabilities health;

pupils special schools closed type, as well as places of deprivation of liberty, passing syllabus secondary education;

graduates receiving secondary vocational education.

The following have the right to take the Unified State Exam:

graduates of previous years (including holders of current results

graduates of secondary (complete) foreign educational institutions.

The corresponding order of the Ministry of Education and Science determines the timing of the examinations. Main period passing the Unified State Exam 2017 starts on May 27 and ends in June. The schedule includes six reserve days. Students who received unsatisfactory grades in mathematics and Russian language ( compulsory subjects), as well as good reason Those who missed the exam are allowed to retake it in September.

Submission of applications and registration for participation in the Unified State Exam

Early completion of the Unified State Examination in computer science in 2017

In September, Rosobrnadzor approved the schedule of unified state exams for 2017. As always, the possibility of early conducting the Unified State Exam(in March-April). The registration date for early exams is no later than February 2017. Early exam in computer science according to the project will be held on March 16. The reserve day for additional retakes is April 3. Basic the stage will pass May 31st.

The right to take the Unified State Exam early is granted to the following persons:

graduates of evening educational institutions;

applicants who go to All-Russian and international competitions, matches, tournaments and olympiads;

students moving to a permanent place of residence or further training to another country;

graduates who, due to health reasons, are sent at the time of the main period of passing the Unified State Exam to a medical facility for the purpose of carrying out health and rehabilitation activities;

graduates Russian schools located geographically outside the Russian Federation;

The main disadvantage of taking the Unified State Exam early is psychological factor. Graduate Exam high school– this is a huge stress, due to which sleep and appetite disturbances appear, and in extreme cases even somatic diseases. TO early delivery Unified State Exam is chained special attention both the press and supervisory authorities, which further intensifies the already difficult situation during the exam. Worries about this can play a cruel joke on the graduate, and the final exam result will be much lower than expected.

Additional information

The 2017 Unified State Examination in computer science (along with literature and mathematics) is one of the longest. It lasts almost 4 hours (235 minutes). During the computer science and ICT exam, it is strictly prohibited to use additional materials and equipment. CMMs are designed in such a way that there is no need to use calculators. The graduate will have to answer questions and simulate a program; there are no complex computational tasks involving the use of technology.

Passing scores for the Unified State Exam in computer science and ICT

The passing level is recorded in 2016 in area 6 primary points. To do this, it is enough to correctly solve eight tasks from the first part. Using the point conversion scale, it was determined that this corresponds to 40 secondary points.

Currently there is increasing interest in exact sciences in general and to computer science in particular. And many universities provide services for training professionals related to this particular subject. Therefore GPA, with which you can actually enter a university is determined at the level of 70-80. Moreover, competition can be observed even for paid places.

Filing appeals

An Unified State Examination result of less than eight primary points is considered unsatisfactory. If an applicant does not agree with the results of his exam, then in the first two working days from the moment the results are announced, he has the opportunity to publicly express his dissatisfaction by filing an appeal. Graduates of the current year's schools can do this directly at their school, graduates of previous years - at the PPE (exam points). The appeal is considered within four days from the moment it is received by the conflict commission. The State Examination Committee recalculates the points and decides to grant or reject the appeal.

If everything went well, and the graduate received a certificate of passing the Unified State Exam, then he can calmly begin choosing a university and submitting documents. It is worth noting that from September 1, 2013, the certificate is valid for four years after its receipt. This condition allows you to enter universities without additional tests a year, two or even three after passing the Unified State Exam.

Preparation for the Unified State Exam in computer science

Successful passing of exams in 11th grade depends further fate graduate, his future, his profession. Therefore, great attention should be paid to preparing for this stage. Preparation for the Unified State Exam in computer science 2017 should begin with studying the relevant literature, which includes school textbooks and additional manuals. After becoming familiar with the theory, it is necessary to master problem-solving skills and adapt to the formulations and requirements of the Unified State Exam.

The Collection of tasks in computer science for the Unified State Exam 2016 under the guidance of E.M. Zorina and M.V. Zorin will help with this. Issue includes assignments different types on all Unified State Exam topics(+ answers to them) and methodological instructions.

You can also use collections typical tasks other authors.

For example: Computer Science. Thematic tests Unified State Exam assignments in computer science. Krylov S.S., Ushakov D.M. or Computer Science. The most complete edition typical options tasks. Ushakov D.M., Yakushkin A.P. These collections were published in 2014, but the structure of the computer science exam has changed slightly, which allows the use of these sources.

Online training

To prepare thoroughly for Unified State Examination Federal The Service for Supervision of Education and Science has created a website with an open task bank. This resource contains information related to the Unified State Exam: regulations, demo versions, manuals, specifications, codifiers. Open bank FIPI (fipi.ru) allows you to find your “ weak points"and work through them, improving both theory and practice. Additionally, a meeting room has been organized on the site to ask questions, whether or not related to the Unified State Examination and the Unified State Examination.

On the website you can download and demo options on any subject. The purpose of the demo is to provide an opportunity Unified State Examination participants and the general public to get acquainted with the structure of the future exam, with the number and wording of tasks, here are the answers to them and an analysis of the assessment criteria.

To assess the quality of students’ preparation for the upcoming exams, online tests and trial exams are organized. An online test is an exam conducted in real time on the Internet. After passing, you can see your results, as well as analyze the correct answers. Online testing can also be used as a method of self-control after studying a certain topic. In schools, a trial exam is organized 1-2 times a year. This helps future students get used to the exam environment, understand organizational issues, learn to allocate time so that there is enough time to complete all tasks and check them.

Psychological preparation for the exam is also important. IN stressful situation It can be quite difficult to put aside anxiety and remember everything that has been taught for 11 years. It is necessary to mentally tune yourself to the “work wave”, step back from the world around you and try to look at the tasks with a sober mind. And this is not so easy to achieve. Firstly, because the Unified State Exam is the first serious exam in a student’s life. Secondly, the immediate future of the applicant (admission or not admission to the desired university) depends on its results. Thirdly, because often the student’s close relatives, his family, behave rudely and carelessly towards the child himself, further weakening the already alarmed nervous system future student.

Statistics for passing the Unified State Exam in computer science for past years

According to Rosobnadzor, in 2013 year of the Unified State Exam In computer science, only 5% of graduates passed, in 2015 - 4% (7% of them received an unsatisfactory grade). Today this item is gaining popularity. In 2016, about 7% of graduates passed the Unified State Examination in computer science and ICT, which is 55,000 students.

Exam Schedule

Foxford Online Learning Center 53 videos

The analyzes are conducted by Timofey Khiryanov, teacher at 100EGE.ru, teacher at the Department of Informatics at MIPT, system developer software Samsung Electronics and Parallels.

Option No. 2385663

Unified State Examination - 2017. Early wave in computer science

When completing tasks 1-23, the answer is one number, which corresponds to the number of the correct answer, or a number, a sequence of letters or numbers. The answer should be written without spaces or any additional characters.

If the option is given by the teacher, you can enter the answers to the assignments in Part C or upload them to the system in one of the graphic formats. The teacher will see the results of completing assignments in Part B and will be able to evaluate the uploaded answers to Part C. The scores assigned by the teacher will appear in your statistics.

Version for printing and copying in MS Word

How many natural numbers x are there for which the inequality 10110111 2 is true? In your answer, indicate only the number of numbers; you do not need to write the numbers themselves.

Answer:

Logic function F is 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 true. Determine which column of the function's truth table F each of the variables corresponds w, x, y, z.

Write the letters in your answer w, x, y, z in the order in which their corresponding columns appear (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, there is no need to put any separators between the letters.

Example. If the function were given by the expression ¬ x ∨ y, depending on two variables: x And y, and a fragment of its truth table was given, containing all sets of arguments for which the function F true.

Then the first column would correspond to the variable y, and the second column is a variable x. The answer should have written: yx.

Answer:

In the figure on the right, the road map of the N district is depicted in the form of a graph; The table on the left contains information about the length of each of these roads (in kilometers).

Since the table and diagram were drawn independently of each other, the numbering settlements in the table is in no way related to letter designations on the graph. Determine the length of the road from point D to point E. Write down an integer in your answer - as it is indicated in the table.

Answer:

Below are two tables from the database. 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 row of Table 1. Determine based on the given data total number daughters and granddaughters of Baurn A.S.

Answer:

A non-uniform binary code was used to encode a raster image printed using six colors. Code words are used to encode colors.

Specify the shortest codeword for encoding blue, under which the code will satisfy the Fano condition. If there are several such codes, indicate the code with the lowest numerical value.

Note. The Fano condition means that no codeword is the beginning of another codeword. This makes it possible to unambiguously decrypt encrypted messages.

Answer:

The Calculator performer has two teams, which are assigned numbers:

1. add 2,

2. multiply by 5.

By performing the first of them, the Calculator adds 2 to the number on the screen, and by performing the second, it multiplies it by 5.

For example, program 2121 is a program

multiply by 5,

add 2,

multiply by 5,

add 2,

which converts the number 2 to the number 62.

Write down the order of commands in a program that converts the number 1 to the number 45 and contains no more than four commands. Enter only command numbers. If there is more than one such program, then write down any of them.

Answer:

A fragment of a spreadsheet is given.

What integer must be written in cell A1 so that the diagram constructed from the values ​​of cells in the range A2:C2 matches the picture? It is known that all cell values ​​from the considered range are non-negative.

Answer:

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.

Answer:

The piece of music was digitized and recorded as a file without using data compression. The resulting file was transmitted to city A via a communication channel in 15 seconds. Then the same piece of music was re-digitized with a resolution 2 times higher and a sampling rate 1.5 times lower than the first time. No data compression was performed. The resulting file was transferred to city B; The bandwidth of the communication channel with city B is 2 times higher than the communication channel with city A. How many seconds did the file transfer to city B last? In your answer, write down only an integer; there is no need to write a unit of measurement.

Answer:

Vasya composes 4-letter words, which can only contain the letters Zh, I, R, A, F, and the letter R is used exactly 1 time in each word. Each of the other valid letters can appear in a word any number of times or not at all. A word is any valid sequence of letters, not necessarily meaningful. How many words are there that Vasya can write?

Answer:

Below, the recursive function (procedure) F is written in five programming languages.

What will the program output when calling F(5)? In your answer, write down the sequence of printed numbers together (without spaces).

Answer:

In TCP/IP network terminology, a network mask is called 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 on this network. Usually the mask is written according to the same rules as the IP address - in as four bytes, with each byte written in the form decimal number. In this case, the mask first contains ones (in the highest digits), and then from a certain digit there are 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 a node with an IP address of 147.192.92.64, the network address is 147.192.80.0. What is the value of the third byte from the left of the mask? Write your answer as a decimal number.

Answer:

When registering in computer system each user is given a password consisting of 15 characters and containing only characters from the 12-character set: A, B, C, D, E, F, G, H, K, L, M, N. In the database for storing information about Each user is allocated the same and minimum possible integer number of bytes. In this case, character-by-character encoding of passwords is used, all characters are encoded the same and minimally possible number bit. In addition to the password itself, the system stores additional information, for which 12 bytes are allocated per user.

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

Answer:

The command system of the ROBOT performer, “living” in a rectangular maze on a checkered plane, includes 4 order commands

and 4 condition checking commands.

Commands-orders:

When executing any of these commands, the ROBOT moves one cell, respectively: up, down ↓, left ←, right →. If the ROBOT starts moving towards the wall next to it,

then it will collapse and the program will be interrupted.

The other 4 commands check the truth of the condition that there is no wall on each side of the cell where the ROBOT is located:

BYE condition

sequence of commands

END OF THE CYCLE

is executed as long as the condition is true.

In design

IF condition

THAT team1

OTHERWISE team2

END IF

running team1(if the condition is true) or team2(if the condition is false). The elementary conditions listed above and their combinations using the unions AND and OR are allowed as conditions in the YET and IF constructions.

How many cells of the maze meet the requirement that, having completed the proposed program, the ROBOT will survive and end up in the shaded cell (cell A1)?

WHILE left is free OR top is free

IF the top is free

ELSE left

END IF

END BYE

Answer:

The figure shows a diagram of roads connecting cities A, B, C, D, D, E, F, Z, I, K, L, M.

On each road you can only move in one direction, indicated by the arrow.

How many exist different ways from city A to city M, passing through city B?

Answer:

Meaning arithmetic expression: 125 + 25 3 + 5 9 – written in the number system with base 5. How many significant zeros does this entry contain?

Answer:

In search engine query language to denote logical operation“OR” uses the symbol “|”, and the symbol “&” is used to denote the logical operation “AND”.

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

How many pages (in thousands) will be found for the query Biology & Physics & Chemistry?

It is believed that all queries were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the queries.

Answer:

There are two segments on the number line: P = and Q = . Indicate the smallest possible length of a segment A such that the formula

(x P) → (((x Q) ∧ ¬(x A)) → ¬(x P))

true for any value of the variable x, i.e. takes the value 1 for any value of the variable x.

Answer:

The program uses a one-dimensional integer array A with indices from 0 to 10. Below is the one written in different languages programming fragment of this program.

At the beginning of the execution of this fragment, the array contained the numbers 27, 17, 7, 0, 7, 17, 27, 17, 10, 7, 0, i.e. A = 27, A = 17, etc. What will be the value of the variable s after execution of this fragment programs?

Answer:

The algorithm is written below in five programming languages. Given a number x as input, this algorithm prints two numbers: L and M. Specify greatest number x, when entered, the algorithm prints first 3 and then 5

Answer:

Write in your answer a number equal to the quantity different meanings input variable k such that the program below outputs the same answer as if the input value k = 25. The value k = 25 is also included in the count of the number of different values ​​of k. For your convenience, the program is provided in five programming languages.

Answer:

Performer Plus converts the number on the screen.

The performer has two teams, which are assigned numbers:

1. Add 2

2. Add 5

The first command increases the number on the screen by 2, the second increases this number by 5. The program for the Plus performer is a sequence of commands.

How many programs are there that convert the number 1 to the number 20?

Answer:

How many different sets of Boolean variable values ​​are there? x 1 , x 2 , … x 7 , y 1 , y 2 , … y 7 that satisfy all of the following conditions?

(x 1 ∧ y 1) ≡ (¬x2 ∨ ¬y2)

(x 2 ∧ y 2) ≡ (¬x3 ∨ ¬y3)

(x 6 ∧ y 6) ≡ (¬x7 ∨ ¬y7)

The answer does not need to list all the different sets of variable values. x 1 , x 2 , … x 7 , y 1 , y 2 , … y 7 , at which it is fulfilled this system equals As an answer, you need to indicate the number of such sets.

Answer:

Receives for processing natural number, not exceeding 10 9. You need to write a program that displays the sum of the digits of a number that are NOT a multiple of 3. If the number does not have digits that are not a multiple of 3, you need to display “NO.” The programmer wrote the program incorrectly. Below this program is presented in five programming languages ​​for your convenience.

Reminder: 0 is divisible by any natural number.

Do the following in sequence.

1. Write what this program will output when you enter the number 645.

2. Give an example of this three-digit number, when entered, the program produces the correct answer.

3. Find all the errors in this program (there may be one or more). It is known that each error affects only one line and can be corrected without changing other lines. For each error:

1) write down the line in which 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 how to correct them for one programming language.

Please note that you need to find errors in an existing program, and not write your own, possibly using a different solution algorithm. The error correction should only affect the line where the error is located.

Given an integer array of 20 elements. Array elements can take integer values ​​from 0 to 10,000 inclusive. Describe on natural language or in one of the programming languages ​​an algorithm that allows you to find and display the number of pairs of array elements in which both numbers are even. In this problem, a pair means two consecutive elements of an array.

For example, for an array of five elements: 6; 1; 4; 6; 10 – answer: 2. The source data is declared as shown below in examples for some programming languages ​​and natural language. It is prohibited to use variables not described below, but it is permitted not to use some of the described variables.

As an answer, you need to provide a fragment of the program (or a description of the algorithm in natural language), which should be located in the 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) or in the form of a flowchart. In this case, you must use the same input data and variables that were proposed in the condition (for example, in a sample written in natural language).

S stones 1 ≤ S ≤ 64.

We will say that a player has a winning strategy if he can win with any moves of the opponent. To describe a player's strategy means to describe what move he should make in any situation that he may encounter. different game enemy.

Complete the following tasks. In all cases, justify your answer.

Task 1

a) Indicate all values ​​of the number S for which Petya can win in one move, and the corresponding winning moves. If, for a certain value of S, Petya can win in several ways, it is enough to indicate one winning move.

b) Indicate a value of S such that Petya cannot win in one move, but for any move Petya makes, Vanya can win with his first move. Describe Vanya's winning strategy.

Task 2

Specify two such values ​​of S for which Petya has a winning

strategy, and two conditions are simultaneously met:

– Petya cannot win in one move;

– Petya can win with his second move, regardless of how Vanya moves.

For everyone specified value 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 with the first or second move in any of Petya’s games;

– Vanya does not have a strategy that will allow him to be guaranteed to win on his first move.

For the given value of S, describe Vanya's winning strategy.

Construct a tree of all games possible with this winning strategy of Vanya (in the form of a picture or table). On the edges of the tree, indicate moves, and at nodes, indicate positions.

Solutions to Part C assignments are not automatically checked.
The next page will ask you to check them yourself.

The Voskhod satellite has a device designed to measure solar activity. During the experiment (this time is known in advance), the device transmits to the observatory every minute via a communication channel a positive integer not exceeding 1000 - the amount of energy solar radiation received for last minute, measured in conventional units.

After the end of the experiment it is transmitted control value- the largest number R that satisfies the following conditions:

1) R - the product of two numbers transmitted at different minutes;

2) R is divisible by 26.

It is assumed that a satisfying reference value existed at the time of transmission.

As a result of interference during transmission, both the numbers themselves and the control value can be distorted.

Write a time- and memory-efficient program (specify the version of programming language you are using, such as Free Pascal 2.6.4) that checks the validity of the check value. A program is considered time efficient if the program operating time is proportional to the number of instrument readings N received, i.e. When N increases by a factor of k, the running time of the program should increase by no more than k times. A program is considered memory efficient if the size of memory used in the program to store data does not depend on the number N and does not exceed 1 kilobyte.

The program should print a report in the following form.

Calculated reference value: ...

Control passed (or Control failed)

If a control value that satisfies the condition cannot be determined, then only the phrase “Control failed” is displayed. Before the program text, briefly describe the solution algorithm you use.

The input to the program in the first line is the number of numbers N ≤ 100,000. Each of the next N lines contains one positive integer not exceeding 1000. In last line control value recorded.

Example input data:

Example output for the example input above:

Calculated reference value: 2860

Control passed

Solutions to Part C assignments are not automatically checked.
The next page will ask you to check them yourself.

Complete testing, check answers, see solutions.