USE

ID 38860. Procurement of bolts and nuts - 01

The store purchases bolts (bolt) and nuts (nut), for which a certain amount of money is allocated. The hardware plant has various modifications of these products at a retail price. When buying, the manager is guided by the following rules:

1. You need to buy as many items as possible, regardless of their type and modification.
2. If you can buy the maximum number of products in different ways, you need to choose the method that will buy the most nuts.
3. If you can buy the maximum number of products with the same number of nuts in different ways, you need to choose the method in which the entire purchase will be cheaper.

Examples

ID 38861. Procurement of bolts and nuts - 02

The store purchases bolts (bolt) and nuts (nut), for which a certain amount of money is allocated. The hardware plant has various modifications of these products at a retail price. When buying, the manager is guided by the following rules:

1. You need to buy as many items as possible, regardless of their type and modification.
2. If you can buy the maximum number of items in different ways, you need to choose the method that will buy the most bolts.
3. If you can buy the maximum number of products with the same number of bolts in different ways, you need to choose the method in which the entire purchase will be cheaper.

Examples

ID 38862. Procurement of bolts and nuts - 03

The store purchases bolts (bolt), nuts (nut), nails (pin), washers (shim) and screws (screw), for which a certain amount of money has been allocated. The hardware plant has various modifications of these products at a retail price. When buying, the manager is guided by the following rules:

1. You need to buy as many items as possible, regardless of their type and modification.
2. If you can buy the maximum number of two different products in different ways, you need to choose the method that will buy the most nuts.
3. If you can buy the maximum number of products with the same number of nuts in different ways, you need to choose the method in which the entire purchase will be cheaper.

Examples

ID 38863. Procurement of bolts and nuts - 04

The store purchases bolts (bolt), nuts (nut), nails (pin), washers (shim) and screws (screw), for which a certain amount of money has been allocated. The hardware plant has various modifications of these products at a retail price. When buying, the manager is guided by the following rules:

1. You need to buy as many items as possible, regardless of their type and modification.
2. If you can buy the maximum number of two different items in different ways, you need to choose the method that will buy the most bolts.
3. If it is possible to buy the maximum number of products in different ways with the same number of other products, you need to choose the method in which the entire purchase will be cheaper.

Examples

ID 38940. Truth table - 15

Yura Barankin filled in the truth table of the function \((\bar y \wedge (x \equiv \bar w)) \wedge (z \vee x)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 38941. Number Divisors - Optimize

For a natural number N , determine the parity of the maximum divisor not equal to N and 1. Print the maximum divisor itself and the word "even", separated by a space, if the maximum divisor is even, and the word "odd" - if odd.

Input
The input is not a simple natural number N (1 <= N <= 10⁹).

Imprint
Print the answer on the screen first, the maximum divisor of the number, then, separated by a space, the word "even", if the maximum divisor is even, and the word "odd" - if odd.
 

Examples

ID 38943. The number with the maximum number of divisors

Given a natural number N - the number of numbers (1<=N<=10³), and natural numbers ai (1<=a_i<=10⁵ ). For each number ai determine the smallest natural number m less than ai that has the maximum number of different divisors.

Input
In the first line, the program receives a natural number  N (1<=N<=103) as input. The following N lines set the numbers ai (1<=ai<=10 5), each number on a separate line.

Imprint
For each number ai print the number m - the smallest natural number less than ai, which has the maximum number of different divisors. Each number m must be printed on a separate line.
 

Examples

ID 38945. Number Divisors - Optimal Algorithm

Given a natural number N - the number of numbers (1<=N<=10³), and non-prime natural numbers ai< /sub> (1<=a_i<=10<sup>5). For each number a_i print its smallest and largest divisors not equal to 1, 2, 3 and a_{i< /sub>/2, ai/3, ai}.  

Input
In the first line, the program receives a natural number  N (1<=N<=103) as input. The following N lines give numbers a_i (100<=a_i<=10 5), each number on a separate line.

Imprint
For each number a_i print two space-separated numbers on a separate line - its  smallest and largest divisors other than 1, 2, 3 and a_i/2, a_i/3, a _i.</sup> 
 

Examples

ID 38946. prime numbers

Write a program that searches among the integers belonging to the numerical interval [1014260; 3025423], prime numbers. Print the first 20 found prime numbers in ascending order, to the left of each number print its number in order.
 

Example of displaying the first 3 numbers

ID 38947. Demo 2022. Question 25

Let M – the sum of the minimum and maximum natural divisors of an integer, not counting one and the number itself. If the number does not have such divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than 700 000, in ascending order and looks for those for which M ends in 8 code>. Print the first five found numbers
and their corresponding M. 
values
Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 38948. Training task - 1

Let M – the difference (modulo) of two paired natural divisors of an integer not equal to one and the number itself. If the number does not have such divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  1 000 000, in ascending order and searches among them for those that have at least one value of M  such that 0 < M < 1000 . Print the first five found numbers and their corresponding M values. If the number of suitable M values ​​has more than one, then output the M value formed by the difference with the minimum divisor not equal to 1.

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – M value (one space apart). Lines are displayed in ascending order of found numbers.

 

Example

ID 38949. Training task - 3

Let M – the sum of the prime natural divisors of an integer, not counting one and the number itself. If the number does not have such divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  500 000, in ascending order and searches among them for those for which the value 10000 < M < 50000 . Print the first five found numbers
and their corresponding M. 
values
Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 38950. Training task - 2

Let M – the number of different even natural  nontrivial divisors of an integer, and SM is the sum of these divisors.
Write a program that iterates over integers greater than  1 000 000, in ascending order and searches among them for those with M = 5. If such the number has no divisors, then the value of SM is considered equal to zero.  Print the first five found numbers and their corresponding SM values. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value SM  (separated by one space). Lines are displayed in ascending order of found numbers.

ID 38951. Training task - 5

Let M – the sum of the minimum even and maximum odd natural divisors of an integer, not counting one and the number itself. If the number does not have any divisor (either even or odd), then the value of this divisor is considered equal to zero.
Write a program that iterates over integers greater than 12,000,000, in ascending order, looking for those for which 0 < M < 1,000,000 . Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 38952. Training task - 4

Let M – the sum of simple natural divisors of an integer, not counting one and the number itself, and KM is the number of such divisors. If the number does not have such divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than 2 560 000, in ascending order and searches among them for those for which M is odd and КM= 6. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 38956. Truth table - 16

Yura Barankin filled in the truth table of the function \(w \wedge (x \vee z)\wedge(x\rightarrow y)\wedge(y\vee z)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 38972. 16-01

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:
F(n) = n * n if n <= 1;
F(n) = F(n-2) + F(n/3) if n > 1 and n is a multiple of 3 but not a multiple of 2;
F(n) = F(n/2) + F(n-3) if n > 1 and n is a multiple of 2 but not a multiple of 3;
F(n) = F(n/2) + F(n/3) if n > 1 and n is a multiple of 2 and a multiple of 3;
F(n) = F(n-1) if n > 1 and n is neither a multiple of 2 nor a multiple of 3.

Find the minimum n value such that F(n) = 104.


 

ID 38989. Number of pairs - 01

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of pairs of the sequence in which both numbers are even, and the sum of the elements of the pair is not more than the maximum even element of the sequence. In your answer, write down the  number of found pairs, then the maximum of the sums of the elements of such pairs (two numbers separated by a space in one line). In this problem, a pair means two successive elements of a sequence.

Assignment file

ID 38990. Error

The square is lined with N × N cells (1 < N < 30). The EM executor can move around the cells by performing one of two commands in one move: right or up. On command to the right EMU moves to the adjacent right cell, on command up – to the adjacent upper one. The square is bounded by external walls. There can also be internal walls between adjacent square cells. EMU cannot pass through walls. 
At the initial moment of time, the EMU has a supply of fruits equal to the number written in the starting cell. When moving from cell to cell, EMU eats a certain number of fruits. When moving to the right, the EMU eats the number of fruits recorded in the cell it moves to, plus 2 more. When moving up, the EMU eats twice the number of fruits recorded in the cell it moves to, Determine the maximum and minimum number of fruits that remain in the reserve at the EMU, passing from the lower left cell (starting cell) to the upper right one.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.
The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 38994. Data storage and sorting

The file contains positive integers. The first line of the file contains the number N - the number of numbers. The following N lines contain the numbers themselves. In your answer, write in the column the 10 largest three-digit numbers.

Assignment file

ID 38995. Number of numbers with sum not greater than S

The file contains positive integers. The first line of the file contains the number N - the number of numbers, and the natural number S. The following N lines contain the actual numbers.
In your answer, indicate two numbers separated by a space: first, the maximum number of numbers that must be added so that the sum does not exceed the number S, then the value of the resulting sum.

ID 38996. Number substitution

In the set of numbers N, replace one number with a number from the set of numbers M so that the sum of the numbers in the set N is as close as possible to the number < code>S. Print three numbers, each on a separate line:
1 line - the number that was replaced from the set N;
2nd line - the number from the set M, which was replaced;
Line 3 - the resulting sum of numbers from the set N.
It is guaranteed that such a substitution can be made. If possible substitutions  several, then choose the one in which the number from the N set is less.

Input
In the first line, enter 3 numbers separated by a space: n (10<=N<=10⁵) - the number of numbers in the set N, < code>m (10<=M<=10⁵) - number of numbers in set M, S ( 10<=S<=10⁹) S>sum(N), where sum(N) is the sum of all numbers in the set < code>N.
The second line contains a set of numbers N: n numbers separated by one space (each number modulo does not exceed 10⁵).
The third line contains a set of numbers M: m numbers separated by one space (each number modulo does not exceed 10⁵).

Imprint
Display the answer to the problem as specified in the condition.
 

Examples

ID 38997. Demo 2022. Problem analysis

The system administrator creates an archive of user files once a week. However, the size of the disk where it places the archive may be less than the total size of the archived files. It is known how much space each user's file occupies. Given information about the size of user files and the free space on the archive disk, determine the maximum number of users whose files can be archived, as well as the maximum size of an existing file that can be stored in the archive, provided that the files of the maximum possible number of users are saved. Write a program that calculates  the maximum number of users whose files can be archived, as well as the maximum size of an existing file that can be archived, provided that the files of the maximum possible number of users are stored.

Input:
The first line contains two numbers: S – free disk space (a natural number not exceeding 100,000) and N – number of users (a natural number not exceeding 10000). The next N lines contain the values ​​of each user's file sizes (all natural numbers, not exceeding 100), each on a separate line.

Output:
Print two space-separated numbers on one line: first, the largest number of users whose files can be archived, then the maximum size of an existing file that can be archived, provided that the files of the maximum possible number of users are stored.
 

Example

ID 39014. Result bonus. Training task - 1

In quizzz "Pass the exam for 100 points" You can score up to 10,000 points. At the end of the game, the first K participants who scored the most points receive a bonus to their points in the form of +30% of the scores.  You know the information about how many points each participant in the game scored. Determine the maximum number of points that the bonus did not apply to, as well as the integer part of the total bonus amount received by the players.

Input and output data
The first line input file contains two numbers separated by spaces: N – total number of players (a natural number not exceeding 10,000) and K – the number of players who receive the bonus. The following N lines contain the results of each participant (the number of points scored - all natural numbers not exceeding 10,000), each in a separate line.  
Write down two numbers in your answer: first, the maximum number of points to which the bonus did not apply, and then the whole part of the sum of all bonuses.

Example input file:
12 4
370
580
3000
1310
1700
2810
1660
1250
1870
1340
1400
1260

With such initial data, the answer should contain two numbers – 1660 2814.
 

ID 39015. Garland brightness. Training task - 2

Ded Moroz's factory produces light bulbs of various weights and brightness. The weight of the bulb does not exceed 100 grams, the brightness of the bulb does not exceed 10,000 lumens. 
K of the brightest light bulbs are selected to make a New Year's garland. If the brightness of two bulbs is the same and they all do not fit in a garland, then place a bulb with a smaller weight.
Information is known about the weight and brightness of each light bulb brought to the workshop to form a New Year's garland.
Determine the total weight of the bulbs in the garland and the average brightness of the entire garland.

Input and output data
In file in the first line space-separated numbers N are written - the number of light bulbs brought to the workshop (natural number, not exceeding 1000) and K –  the number of light bulbs in the garland (a natural number not exceeding 100). Each of the following N lines contains two numbers – the weight and brightness of each bulb.
Write in the answer two numbers – first, the total weight of the bulbs in the garland, then the average brightness of the entire garland (only the whole part).

An example of the organization of source data in the input file:

9 4
50 600
60 480
45 540
30 300
15 180
70 560
30 360
91 910
40 320

Response: 256 652
 

ID 39022. Gymnastic ribbons. Training task - 3

ID 39023. 16-02

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 0 if n <= 0;
F(n) = F(n - 2) if n > 0, the last digit of the number n is even and the number n is not a multiple of 4;
F(n) = F(n / 4) + F(n - 2) if n > 0, number n is a multiple of 4;
F(n) = n + F(n - 1) if n > 0 and n odd;

How many different values ​​of n, less than 100 will result in F(n) ending in 1?


 

ID 39024. Sections - 01

Two segments are given on the number line: B = [10; 20] and C = [12; 30]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39025. Sections - 02

Two segments are given on the number line: B = [10; 35] and C = [25; 49]. Specify the largest possible length of such segment A for which the logical expression

ID 39030. Sections - 03

Two segments are given on the number line: B = [10; 40] and C = [15; 50]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39031. Sections - 04

Three segments are given on the number line: B = [5; 30], C = [1; 20] and D = [25; 45]. Specify the largest possible length of such segment A for which the logical expression

ID 39032. Ways - 01

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, passing through city G?

ID 39034. Ways - 02

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, passing through city B?

ID 39035. Ways - 03

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, passing through city B?

ID 39036. Ways - 04

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, passing through city G?

ID 39037. Ways - 05

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L passing through city D?

ID 39038. Ways - 06

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, passing through city G?

ID 39039. Ways - 07

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L passing through city D?

ID 39040. Ways - 08

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L passing through city K?

ID 39041. Ways - 09

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, but not passing through city B?

ID 39042. Ways - 10

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, but not passing through city D?

ID 39043. Ways - 11

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, but not passing through city Z?

ID 39044. Ways - 14

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

ID 39045. Ways - 12

The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F,  W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L, but not passing through city E?

ID 39046. Ways - 13

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

ID 39047. Ways - 15

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

ID 39050. Let's count the numbers - 03

The value of an arithmetic expression

ID 39049. Let's count the numbers - 02

The value of an arithmetic expression

ID 39048. Let's count the numbers - 01

The value of an arithmetic expression

ID 39051. Let's count the numbers - 04

The value of an arithmetic expression

ID 39053. Let's count the numbers - 06

The value of an arithmetic expression

ID 39052. Let's count the numbers - 05

The value of an arithmetic expression

ID 39069. Number of pairs - 02

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of pairs in the sequence in which the sum of the numbers is a multiple of three and both numbers are less than the arithmetic mean of all even numbers in the sequence. In your answer, write down the  number of found pairs, then the minimum of the sums of the elements of such pairs (two numbers separated by a space in one line). In this problem, a pair means two successive elements of a sequence.

Assignment file

ID 39070. Number of pairs - 03

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of pairs in the sequence in which at least one element is a divisor of the sum of all numbers in the sequence. In your answer, write down the  number of found pairs, then the minimum of the sums of the elements of such pairs (two numbers separated by a space in one line). In this problem, a pair means two successive elements of a sequence.

Assignment file

ID 39071. Pairs of numbers - 04

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of pairs of the sequence in which both numbers are even, and the sum of the elements of the pair is not more than the minimum odd element of the sequence. In your answer, write down the  number of found pairs, then the maximum of the sums of the elements of such pairs (two numbers separated by a space in one line). In this problem, a pair means two successive elements of a sequence.

Assignment file

ID 39072. Number of pairs - 05

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of pairs of the sequence in which both numbers end in F in the hexadecimal number system, and the sum of the elements of the pair has the same sign as the sum of all elements divisible by 16. In your answer, write down the  number of found pairs, then the maximum from the sums of the elements of such pairs (two numbers separated by a space in one line). In this problem, a pair means two successive elements of a sequence.

Assignment file

ID 39073. Threes - 01

The file contains a sequence of integers. Sequence elements can take integer values ​​from -10 000 to 10 000 inclusive. Determine the number of triples in the sequence in which the sum of the last digits of each of the numbers is an even number, and the minimum of these numbers is not less than the minimum odd among all the numbers in the sequence. In your answer, write down the  number of triples found, then the maximum number of all such triples (two numbers separated by a space on one line). In this task, under  a triple means three consecutive elements of a sequence.

Assignment file

ID 39074. Threes - 02

The file contains a sequence of integers. Sequence elements can take integer values ​​from -15000 to 15000 inclusive. Determine the number of triples in the sequence in which all three numbers form an increasing sequence, and the sum of the numbers in the triple has the same parity as the sum of all the numbers. In your answer, write down the  number of triples found, then the maximum of the sums of the elements of such  triples (two numbers separated by a space in one line) . In this task, under  a triple means three consecutive elements of a sequence.

Assignment file

ID 39075. Threes - 03

The file contains a sequence of integers. Sequence elements can take integer values ​​from -15000 to 15000 inclusive. Determine the number of triples in the sequence in which the second element is less than both of its neighbors, and at the same time the sum of the numbers in the triple has the opposite sign from the sum of all numbers. In your answer, write down the  number of triples found, then the minimum of the sums of the elements of such triples (two numbers separated by a space in one line) . In this task, under  a triple means three consecutive elements of a sequence.

Assignment file

ID 39076. Threes - 04

The file contains a sequence of integers. Sequence elements can take integer values ​​from -15000 to 15000 inclusive. Determine the number of triples in the sequence in which the third number is not less than the sum of the first two, and the sum of the first two is not greater than the sum of all numbers in the file that are multiples of 15. In your answer, write down the  number of triples found, then the maximum sum of all the sums of the first two numbers (two numbers separated by a space in one line). In this task, under  a triple means three consecutive elements of a sequence.

Assignment file

ID 39077. Threes - 05

The file contains a sequence of integers. Sequence elements can take integer values ​​from -15000 to 15000 inclusive. Determine the number of triples in the sequence in which the second element is greater than both of its neighbors, and the sum of the numbers in the triple has the same sign as the sum of all the numbers. In your answer, write down the  number of triples found, then the maximum of the sums of the elements of such  triples (two numbers separated by a space in one line) . In this task, under  a triple means three consecutive elements of a sequence.

Assignment file

ID 39078. Sections - 05

Two segments are given on the number line: B = [5; 15], C = [30; 60]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39079. Sections - 06

Two segments are given on the number line: B = [40; 80], C = [120; 150]. Specify the largest possible length of such segment A for which the logical expression

ID 39080. Sections - 07

Three segments are given on the number line: B = [0; 50], C = [25; 60] and D = [35; 80]. Specify the largest possible length of such segment A for which the logical expression

ID 39081. Sections - 08

Three segments are given on the number line: B = [0; 70], C = [30; 60] and D = [20; 90]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39082. Sections - 09

Three segments are given on the number line: B = [10; 40], C = [20; 85] and D = [70; 90]. Specify the largest possible length of such segment A for which the logical expression

ID 39083. Segments - 10

There are three segments on the number line: B = [25; 80], C = [60; 75] and D = [35; 70]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39084. Sections - 11

There are three segments on the number line: B = [25; 80], C = [60; 75] and D = [70; 90]. Specify the smallest possible length of such a segment A for which the logical expression

ID 39085. Let's count the numbers - 07

The value of an arithmetic expression

ID 39086. Let's count the numbers - 08

The value of an arithmetic expression

ID 39087. Let's count the numbers - 09

The value of an arithmetic expression

ID 39088. Let's count the numbers - 10

The value of an arithmetic expression

ID 33407. File Analysis - 07

The first line of the text file indicates the number of lines in the file containing various characters of the English alphabet (from A to Z). Determine the number of lines in which the number of characters denoting a vowel of the English alphabet is greater than the number of characters denoting a consonant. Please answer with one number.

To complete this task, you must write a program. 
 

File  

ID 39159. File Analysis - 08

The text file consists of the characters M, A, R, S. Define the maximum number of consecutive characters  in the attached file, among which there are no consecutive characters M. To complete this task, you must write a program.

Assignment file

 

ID 39182. 16-03

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 3 if n <= 0;
F(n) = F(n / 6) + 12 if n > 0 and the number n is a multiple of 6;
F(n) = F(n - n mod 6) if n > 0 and the number n is not a multiple of 6;

What is the maximum value of n, result F(n) at most 25?
The operation a mod b calculates the remainder of dividing a by b.


 

ID 39183. 16-04

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 5 if n <= 0;
F(n) = F(n / 15) + F(n - 10) if n > 0, and the number n is a multiple of 15;
F(n) = F(n - 3) if n > 0, the number n when divided by 15 is 3;
F(n) = F(n - 1) + n if n > 0 and n is not a multiple of 15, and when divided by 15 the remainder is not 3;

What is the minimum value of n, for F(n) to exceed 200?


 

ID 39184. 16-05

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 5 if n <= 0;
F(n) = F(n / 4) + 7 if  0 < n <= 100, and n is a multiple of 4;
F(n) = F(n - 1) + 17 if  0 < n <= 100, and n is not a multiple of 4;
F(n) = F(n - 4) if n > 100.

What is the minimum value of n, for F(n) to exceed 100?


 

ID 39185. 16-06

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 0 if n <= 0;
F(n) = F(n / 3) + n if 0 < n <= 100, and the number n  is a multiple of 3;
F(n) = F(n - 1) + n if 0 < n <= 100 and n is not a multiple of 3;
F(n) = F(n - 3) if n > 100.

With how many different values n, in the range [100, 250], the result F(n) will be equal to 266?


 

ID 39186. 16-07

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 0 if n <= 10;
F(n) = F(n / 7) + n if 10 < n <= 200, and the number n  is a multiple of 7;
F(n) = F(n - 1) + n if 10 < n <= 200 and n is not a multiple of 7;
F(n) = F(n - 7) if n > 200.

With how many different values n, in the range [1, 100], the result F(n) will be equal to n?


 

ID 39187. 16-08

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 3 if n <= 0;
F(n) = F(n / 5) + n if 0 < n <= 100, and the number n  is a multiple of 5;
F(n) = F(n - 1) + n if 0 < n <= 100 and n is not a multiple of 5;
F(n) = F(n - 5) if n > 100.

With how many different values n, in the range [100, 250], the value F(n) and number n will be the same parity (then are either both odd or both even)?


 

ID 39188. 16-09

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 3 if n <= 10;
F(n) = F(n / 5) + n if 10 < n <= 200, and the number n  is a multiple of 5;
F(n) = F(n - 1) + n if 10 < n <= 200 and n is not a multiple of 5;
F(n) = F(n - 5) if n > 200.

For how many different values n, not exceeding 250, the result F(n) will be equal to 243?


 

ID 39189. 16-10

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 3 if n <= 10;
F(n) = F(n / 7) + n - 1 if 10 < n <= 200, and the number n  is a multiple of 7;
F(n) = F(n - 1) + n + 1 if 10 < n <= 200 and n is not a multiple of 7;
F(n) = F(n - 7) + 7 if n > 200.

What is the smallest value of n result F(n) will be equal to 106?


 

ID 39191. File analysis

The text file consists of no more than 10⁶ characters and contains only uppercase Latin letters (ABC…Z). The text is divided into lines of various lengths. It is necessary to find the string in which the sequence of letters AA occurs most often. If there are several such lines, you need to take the one that was encountered earlier in the file. Determine in this string the length of the longest subsequence in which there are no two adjacent identical letters. Write down the length of this subsequence in your answer.

Example
Source file:
AAAABABC
ZZAAAACZ
QRAAUT
In this example, the sequence AA occurs 3 times in the first and second lines, in the third – 1. We take the first line, because it is in the file before. This line contains the longest subsequence that does not contain two adjacent identical letters  ABABC, its length is 5. In the answer for this example, write 5.

Assignment file

ID 39192. File analysis

The text file consists of no more than 10⁶ characters and contains only uppercase Latin letters (ABC…Z). The text is divided into lines of various lengths. It is necessary to find a string that contains the longest subsequence between two letters A  (the first and last letters of A are also included in the subsequence) and other letters A is not in this subsequence. If there are several such lines, you need to take the one that was encountered earlier in the file. Determine which letter occurs most often in this subsequence. If there are several such letters, you need to take the one that is earlier in the alphabet. Write down the found letter in the answer, as well as how many times it occurs in the entire file.

Example
Source file:
AABABC
ZZAACZCCA
QRAAUTUTA
In this example, in the first line the searched subsequence (ABA) has length 3, in the second line (ACZСA) and in the third line (AUTUTA)  ; - length 6. We take the second line, because it is in the file before. In this subsequence, the letter C occurs most often, it occurs 4 times in the entire file. In the answer for this example, write C4.

Assignment file

ID 39193. Integer Divisors

Let M – the sum of 5 minimum non-trivial divisors of an integer (excluding one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 0 and even. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39194. Integer Divisors

Let M – the sum of 5 minimum non-trivial divisors of an integer (excluding one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 0 and all digits of M are even. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39195. Integer Divisors

Let M – the sum of 5 minimum non-trivial divisors of an integer (excluding one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 0 and all digits of M are odd. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39196. Integer Divisors

Let M – the sum of 4 non-trivial divisors of an integer - two minimum and two maximum (not counting the unit and the number itself). If the number does not have 4 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 0 and digits of the number M form a non-decreasing sequence. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39197. Integer Divisors

Let M – the sum of 4 non-trivial divisors of an integer - two minimum and two maximum (not counting the unit and the number itself). If the number does not have 4 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 17,000,000 and the decimal notation M ends in 35. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39198. Integer Divisors

Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 20 000 000 and the sum of the digits of the number M is a multiple of 7. Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39199. Integer Divisors

Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than  20 ​​000 000, in ascending order and looks among them for those for which the value M > 20 000 000 and the sum of the number formed by 3, 2 and 1 digits of M and the number formed by 6, 5 and 4 digits of M is a multiple of 5 (digits are counted from the end of the number, starting from 1).
For example,  with М = 12345678 the number formed by 3, 2 and 1 digits -  678, the number formed by 6, 5 and 4 digits - 345.
Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.

ID 39221. Integer Divisors

Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over the integers less than 20 000 000, in descending order and finds among them the first five such that the value 0 < M < 5 000 000 and the number formed by 3, 2 and 1 digits of the number M is not greater than the number formed by 6, 5 and 4 digits of the number M (digits are counted from the end of the number, starting from 1) .
For example,  with М = 12345678 the number formed by 3, 2 and 1 digits -  678, the number formed by 6, 5 and 4 digits - 345.
Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in descending order of found numbers.

ID 39222. Integer Divisors

Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over the integers less than 20 000 000, in descending order and finds among them the first 5 for which the value M > 10,000,000 and M is a multiple of its sum of digits.

Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in descending order of found numbers.

ID 39223. Integer Divisors

Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over the integers less than 20 000 000, in descending order and finds among them the first 5 for which the value 0 < M < 10 000 000 and in M there is only one  even digit.

Print the first five found numbers and their corresponding values ​​M. 

Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in descending order of found numbers.

ID 39225. super stadium

The planet Bluk is home to the largest super stadium in the galaxy. In the super stadium 10,000 rows, numbered starting from 1. In each row  10 000 places numbered starting from 1. To date, the Superstar concert has sold N tickets. The file contains information about sold tickets: row number and seat number in this row. Determine which row has the most vacant seats adjacent to each other. If there are the same number of such seats in several rows, then indicate the minimum number of the row. And also indicate the minimum number of the place from which such free places begin. 

Input
The first line of the input file contains an integer N – the total number of tickets sold. Each of the following N lines contains 2 integers: the row number and the position number in this row.

In your answer, write down two integers: the number of the row that has the most empty seats next to it, then – the minimum number of the place from which such free places begin.

An example of the organization of the initial data in the input file (with 5 rows and 5 places in a row):

17
1 2
23
24
3 1
3 2
4 1
4 2
4 3
5 1
5 5
5 4
5 2
5 3
34
3 5
4 5
15

Response: 1 3

Assignment file

ID 39226. Gymnastic ribbons

ID 39245. Healthy chocolate

Hearing that chocolate is good for the brain and nervous system, student Vasily decides to buy chocolate for the entire academic year. Vasily decided to buy chocolate for R rubles. He walked around in the city all N shops that sell various chocolates. Vasily saved to a file the information that in ith shop he can buy no more Bi bars of chocolate by < code>A_i rubles each.
A thrifty student wants to spend as much of his money as possible (preferably all at once) and buy as much chocolate as possible with it. Help Vasily figure out how many chocolate bars he can buy with his own money and how much the most expensive bar he can buy will cost.

Input
The first line in the file contains two numbers: N and R. The following N lines contain a pair of numbers: Ai and Bi.< br />
In your answer, write two numbers separated by a space on one line: first, the number of chocolate bars that Vasily can buy with his own money, then the cost of the most expensive chocolate bar that Vasily will have after the purchase.

Assignment file
 

ID 39247. Goshin sequence

Math lover Gosha came up with his own sequence. The rules in its sequence are:
1) all numbers in the sequence have their own number;
2) the first element of the sequence has number 1;
3) each number in the sequence must be divisible by its number;
4) the number with a larger number must be no less than the number with a smaller number.

An example of Gosha's sequence: 1 4 6 8 10 18 21.

Given a set of numbers, determine what is the maximum number of numbers that can be chosen to compose the Goshin sequence, as well as what is the maximum number that can be in it.

Input
The first line of the input file contains the number N - the number of numbers in the file. Next comes N natural numbers (N <= 10⁵), each on a separate line.

Write down in your answer: first, the maximum number of numbers that can be chosen to make the Goshin sequence, then the maximum number that can be in this sequence.

Example input file:

12
25
17
20
15
6
9
10
12
5
3
4
1

ID 39249. Goshin sequence

Math lover Gosha came up with his own sequence. The rules in its sequence are:
1) all numbers in the sequence have their own number;
2) the first element of the sequence has number 1;
3) each number in the sequence must be divisible by its number;
4) the number with the larger number must be greater than the number with the smaller number.

An example of Gosha's sequence: 1 4 6 8 10 18 21.

Given a set of numbers, determine what is the maximum number of numbers that can be chosen to make the Goshin sequence, and also what is the maximum number that can be in it.


Input
The first line contains the number N - the number of numbers in the file (N <= 10⁵). Next comes N natural numbers (no more than 10⁶), each on a separate line.

Input
Print two space-separated numbers: first, the maximum number of numbers that can be chosen to make the Goshin sequence, then the maximum number that can be in this sequence.

 

Examples

ID 39301. excel file processing

Open the spreadsheet file containing each line four natural numbers. Find out how many quadruples of numbers can be sides of a rectangle. Write only the number in your answer.

Assignment file
 

ID 39302. excel file processing

Open the spreadsheet file containing each line four natural numbers.
Find out how many quadruples of numbers can be sides rectangle. Write only the number in your answer.

Assignment file

ID 39303. excel file processing

Open the spreadsheet file containing each line four natural numbers.
Find out how many quadruples of numbers can be sides square. Write only the number in your answer.

Assignment file

ID 39304. excel file processing

Open the spreadsheet file containing each line three natural numbers.
Find out how many triplets of numbers can be sides right triangle. Write only the number in your answer.

Assignment file
 

ID 39305. excel file processing

Open the spreadsheet file containing each line three natural numbers.
Find out how many lines have the sum of any two numbers equals the third number. Write only the number in your answer.

Assignment file
 

ID 39306. excel file processing

Open the spreadsheet file containing each line three natural numbers.
Find out how many lines have at least two the same numbers. Write only the number in your answer.

Assignment file

ID 39307. excel file processing

Open the spreadsheet file containing each line four natural numbers.
Find out how many lines have at least one a number with one digit. Write only the number in your answer.

Assignment file
 

ID 39308. excel file processing

Open the spreadsheet file containing each line three natural numbers.
Find out how many triplets of numbers can be sides right triangle. In your answer, write down the minimum area of ​​such a right triangle.

Assignment file
 

ID 39309. Error

The square is lined with N × N cells (1 < N < 30). The EM performer can move around the cells by performing one of two commands in one move: left or down. On command left EMU moves to the adjacent left cell, on command down – to the adjacent lower one. The square is bounded by external walls. There can also be internal walls between adjacent square cells. EMU cannot pass through walls. 
At the initial moment of time, the EMU has a supply of fruits equal to the number written in the starting cell. When moving from cell to cell, EMU eats a certain number of fruits. When moving to the left, the EMU eats as many fruits as it is written in the cell to which it moves, plus 5 more. When moving down, the EMU eats the amount of fruit that is 2 times less than the number recorded in the cell to which it moves, and, at the same time, if the cell contains an even number, otherwise he eats only one fruit. Determine the maximum and minimum number of fruits that the EST has in stock by going from the top right square (starting square) to the bottom left.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.
The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39324. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using three commands: left, down or jump. On command to the left Ralph moves to the adjacent cell to the left, on command down – to the next lower one, by command jump Ralph moves to the cell, which is located one to the left and two below the current cell (see example). The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot walk through the walls, but he can jump over the innerwalls of the labyrinth with the jump command. Ralph can't go outside the labyrinth.
At the initial moment of time, Ralph has a star score equal to the number written in the starting cell. Each cell of the maze contains an integer. When moving from cell to cell, Ralph's score changes to the number that is written in the cell to which he moves. At the same time, if the number is positive, then the score increases, if it is negative, it decreases.
Determine the maximum and minimum star scores if Ralph starts from the top right cell and ends at the bottom left.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

Example of moving Ralph with the command jump

ID 39325. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using three commands: right, up , or jump. On command to the right Ralph moves to the neighboring right cell, on command up – to the adjacent upper one, by command jump Ralph moves to the cell, which is located one to the right and two higher from the current cell (see example). The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot walk through the walls, but he can jump over the innerwalls of the labyrinth with the jump command. Ralph can't go outside the labyrinth.
At the initial moment of time, Ralph has a star score equal to the number written in the starting cell. Each cell of the maze contains an integer. When moving from cell to cell, Ralph's score changes to the number that is written in the cell to which he moves. At the same time, if the number is positive, then the score increases, if it is negative, it decreases.
Determine the maximum and minimum star scores if Ralph starts from the bottom left cell and ends at the top right.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

Example of moving Ralph with the command jump

ID 39326. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using two commands: right or up. On command to the right Ralph moves to the neighboring right cell, on command up – to the next upper one. The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot go through walls. Ralph can't go outside the labyrinth either.
In each cell of the maze, Ralph eats a certain number of pancakes. In the starting cell, he also eats pancakes. The number of pancakes Ralph eats is determined by the rules of the maze. If the number indicated in the cell is even, then Ralph eats half of the indicated number, otherwise, he eats all the pancakes.
Determine the maximum and minimum number of pancakes that Ralph will eat by moving from the lower left cell (starting cell) to the upper right one.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39327. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using two commands: right or down. On command to the right Ralph moves to the neighboring right cell, on command down – to the next lower one. The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot go through walls. Ralph can't go outside the labyrinth either.
In each cell of the maze, Ralph eats a certain number of pancakes. In the starting cell, he also eats pancakes. The number of pancakes Ralph eats is determined by the rules of the maze. If the number indicated in the cell is a multiple of three, then Ralph eats a third of the indicated number, otherwise, he eats only one pancake.
Determine the maximum and minimum number of pancakes that Ralph will eat by moving from the top left cell (starting cell) to the lower right.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39328. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can move using three commands: right, down or oblique. By command right Ralph moves to the neighboring right cell, by command down – to the adjacent lower, on command & nbsp; obliquely - to the next cell diagonally to the right and down. The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot go through walls. Ralph can't go outside the labyrinth either.
In each cell of the maze, Ralph eats a certain number of pancakes. In the starting cell, he also eats pancakes. The number of pancakes Ralph eats is determined by the rules of the maze. If the number indicated in the cell ends in 5, then Ralph eats a fifth of all the pancakes, otherwise, he eats all the pancakes.
Determine the maximum and minimum number of pancakes that Ralph will eat by moving from the top left cell (starting cell) to the lower right.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39329. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using three commands: left_1, left_2, or up.  By command left_1 Ralph moves to the adjacent left cell, by command left_2 – through one cell to the left, on command & nbsp; up - to the next cell above. The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot go through walls. Ralph can't go outside the labyrinth either.
Each cell of the maze contains an integer. Getting into each cell, Ralph updates his score by the value of the number written in the cell in which he falls. Moreover, if the number written in the cell is positive, then Ralph's score increases, if negative, it decreases. Ralph's starting score is written in the starting square. 

Determine the maximum and minimum score that Ralph will have when moving from the lower right cell of the labyrinth (starting cell) to the upper left.

Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39340. Error

Ralph, the hero of eight-bit computer games, got into a labyrinth of  N × N cells (1 < N < 30). According to the rules of the maze, Ralph can navigate using three commands: left_1, left_2, or up.  By command left_1 Ralph moves to the adjacent left cell, by command left_2 – through one cell to the left, on command & nbsp; up - to the next cell above. The square is bounded by outer walls. There can also be internal walls between adjacent square cells. Ralph cannot go through walls. Ralph can't go outside the labyrinth either.
Each cell of the maze contains an integer. Getting into each cell, Ralph updates his score by the value of the number written in the cell in which he falls. Moreover, if the number written in the cell is positive, then Ralph's score increases, if negative, it decreases. Ralph's starting score is recorded in the starting cell. Cells with a green highlighted background are bonus. When passing through these cells, Ralph's score increases by 10 times the number written in it. Cells with a red highlighted background are penalty. When passing through these cells, Ralph's score decreases by a number 10 times greater than that written in it. 
Determine the maximum and minimum score that Ralph will have when moving from the lower right cell of the labyrinth (starting cell) to the upper left.
Answer two numbers – first the maximum number, then the minimum. Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 39349. Error

The square is lined with N × N cells (1 < N < 30). The executor Robot can move around the cells, performing one of two commands for one movement: right or up. On command to the right the Robot moves to the adjacent right cell, on command up – to the next upper one. The square is bounded by outer walls. There can also be internal walls between adjacent cells of a square. The robot cannot pass through the wall.
Before each start of the Robot, in each cell of the square there is a coin with a value from 1 to 100. Having visited the cell, the Robot takes the coin with him; this also applies to the start and end cells of the Robot's route.
Determine the maximum and minimum amounts of money that the Robot can collect by going from the bottom left cell to the top right. Answer two numbers – first the maximum amount, then the minimum.

The source data is a spreadsheet of size N × N, each cell of which corresponds to a square cell. The inner and outer walls are marked with thick lines.
 

Sample input

ID 39398. GROMOZEKA

To encode a certain sequence consisting of all capital letters of the Russian alphabet, we decided to use a non-uniform binary code that satisfies the condition that no code word is the beginning of another code word. This condition ensures that encoded messages can be unambiguously decrypted. The code words of the first letters of the alphabet are known: A - 00, B - 01. What is the smallest length of the GROMOZEKA subsequence code?
 

ID 39399. KAMCHATKA - 2

To encode a certain sequence consisting of all capital letters of the Russian alphabet, we decided to use a non-uniform binary code that satisfies the condition that no code word is the beginning of another code word. This condition ensures that encoded messages can be unambiguously decrypted. Known code words  some letters of the alphabet: B - 010, C - 011. What is the smallest length of the KAMCHATKA subsequence code?
 

ID 39457. GROMOZEKA-2

To encode a certain sequence consisting of all capital letters of the Russian alphabet, we decided to use a non-uniform binary code that satisfies the condition that no code word is the beginning of another code word. This condition ensures that encoded messages can be unambiguously decrypted. The code words of the first letters of the alphabet are known: A - 00, B - 01. The remaining letters are encoded in such a way that the code of the subsequence GROMOZEKA has the smallest possible length. Specify the shortest possible code word for the letter O , in which the code will satisfy the specified condition. If there is more than one such code, indicate the code with the smallest numerical value.

 

ID 39473. Number of subsequences

Given a sequence of N natural numbers. All its continuous subsequences starting from the first element of the sequence are considered. Find the number of subsequences whose sum is a multiple of K.

Input
The first line contains two numbers: the number of numbers in the sequence N (1 <= N <= 10⁸) and the number K ( 1 <= K <= 100). Next comes N lines, one natural number per line. Each number does not exceed 10000.

Imprint
Display the answer to the problem
 
 

Examples

ID 39558. Truth table - 17

Yura Barankin filled in the truth table of the function \(\neg {(w \rightarrow x)} \wedge ((y \equiv z) \vee y \wedge \bar z)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39559. Truth table - 22

Yura Barankin filled in the truth table of the function \(y \wedge (x \neq w) \wedge (z \rightarrow x)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39562. Truth table - 19

Yura Barankin filled in the truth table of the function \((y=z) \vee \bar y \wedge (x \vee w) \vee \neg (w \rightarrow \bar y)\) . At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39563. Truth table - 20

Yura Barankin filled in the truth table of the function \(w \rightarrow (x \wedge \bar y \vee (y \equiv z))\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39571. Truth table - 21

Yura Barankin filled in the truth table of the function \((z \rightarrow (x \wedge w))\vee \bar w \wedge (x \rightarrow y)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39573. Truth table - 22

Yura Barankin filled in the truth table of the function \(\neg (z \rightarrow x)\wedge(w\rightarrow y)\). At the moment when Kostya called him out for a walk, Yura managed to fill in only a fragment of three different rows of the table. After the walk, Yura noticed that he had not indicated which column of the table each of the variables w, x, y, z corresponds to.

ID 39603. Memory for identifiers - 1

When registered in a computer system, each object is assigned an identifier consisting of 319 characters and containing only decimal digits and characters from the 4540-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 32768 identifiers. In the answer, write down only an integer - the number of KB.

ID 39604. Memory for identifiers - 2

When registered in a computer system, each object is assigned an identifier consisting of 161 characters and containing only decimal digits and characters from the 3134-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 65536 identifiers. In the answer, write down only an integer - the number of KB.

ID 39605. Memory for identifiers - 3

When registered in a computer system, each object is assigned an identifier consisting of 388 characters and containing only decimal digits and characters from the 3464-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 65536 identifiers. In the answer, write down only an integer - the number of KB.

ID 39606. Memory for identifiers - 4

When registered in a computer system, each object is assigned an identifier consisting of 364 characters and containing only decimal digits and characters from the 2773-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 32768 identifiers. In the answer, write down only an integer - the number of KB.

ID 39607. Memory for identifiers - 5

When registered in a computer system, each object is assigned an identifier consisting of 299 characters and containing only decimal digits and characters from the 3540-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 4096 identifiers. In the answer, write down only an integer - the number of KB.

ID 39608. Memory for identifiers - 6

When registered in a computer system, each object is assigned an identifier consisting of 144 characters and containing only decimal digits and characters from the 1436-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 8192 identifiers. In the answer, write down only an integer - the number of KB.

ID 39609. Memory for identifiers - 7

When registered in a computer system, each object is assigned an identifier consisting of 259 characters and containing only decimal digits and characters from the 2489-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 32768 identifiers. In the answer, write down only an integer - the number of KB.

ID 39610. Memory for identifiers - 8

When registered in a computer system, each object is assigned an identifier consisting of 340 characters and containing only decimal digits and characters from the 3916-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 8192 identifiers. In the answer, write down only an integer - the number of KB.

ID 39611. Memory for identifiers - 9

When registered in a computer system, each object is assigned an identifier consisting of 203 characters and containing only decimal digits and characters from the 1977-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 8192 identifiers. In the answer, write down only an integer - the number of KB.

ID 39612. Memory for identifiers - 10

When registered in a computer system, each object is assigned an identifier consisting of 215 characters and containing only decimal digits and characters from the 4483-character alphabet. In the database, each identifier is stored in the same and the minimum possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the amount of memory (in KB) required to store 4096 identifiers. In the answer, write down only an integer - the number of KB.

ID 39618. File analysis

The text file consists of no more than 10⁶ characters and contains only uppercase Latin letters (ABC…Z). The text is divided into lines of various lengths. We call a subsequence original if it is bounded on the left by the substring  AB, and on the right by the substring BA  (these substrings are also included in the subsequence) and there are no other letters in this subsequence A and B. The original subsequence cannot start on one line and end on another.
Determine how much  total  original subsequences in the entire file, as well as the length of the maximum of them.

In your answer, write together two integers, first the number of original subsequences, then the length of the maximum of them.

Example
Source file:
AAABCAABCBAA
ZZABZZZBABCBA
QRABUTUUBA
There are 4 original subsequences in this example (ABUTUTBA, ABZZZBA, ABCBA, ABUTUTBA)
The longest subsequence (ABUTUTBA) has a length of 8.
Answer: 48


Assignment file

ID 39654. Error

The value of an arithmetic expression

ID 39655. Error

The value of an arithmetic expression

ID 39656. Error

The value of an arithmetic expression

ID 39721. Dividers with range - 01

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the smallest natural number A< /code> boolean expression

ID 39722. Dividers with range - 03

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the smallest natural number A< /code> boolean expression

ID 39723. Dividers with range - 02

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the largest natural number A< /code> boolean expression

ID 39724. Dividers with range - 04

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the largest natural number A< /code> boolean expression

ID 39725. Dividers with range - 05

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the smallest natural number A< /code> boolean expression

ID 39726. Dividers with range - 06

Let us denote by DIV(n, m) the statement "a natural number n is divisible without remainder by a natural number m". For what is the largest natural number A< /code> boolean expression

ID 39746. 16-11

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 1;
F(n) = 15 + f(n/3) if n > 0, and the number n is a multiple of 3;
F(n) = 7 + f(n/2) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], the function F(n)=137?
The sign / - means the operation of integer division.


 

ID 39747. 16-12

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 12;
F(n) = 21 + f(n/5) if n > 0, and the number n is a multiple of 5;
F(n) = 1 + f(n/2) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], the function F(n)=37?
The sign / - means the operation of integer division.


 

ID 39748. 16-13

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 12;
F(n) = 1 + f(n/15) if n > 0, and the number n is a multiple of 15;
F(n) = 1 + f(n/30) otherwise.

Determine how many different values ​​the F(n) function takes on the segment [1, 1000000]?
The sign / - means the operation of integer division.


 

ID 39749. 16-14

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 12;
F(n) = 1 + f(n/3) if n > 0, and the number n is a multiple of 3;
F(n) = 1 + f(n/15) otherwise.

Determine how many different values ​​the F(n) function takes on the segment [1, 1000000]?
The sign / - means the operation of integer division.



 

ID 39750. 16-15

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = -1;
F(n) = f(n-1) + f(n/4) if n > 0, and the number n is a multiple of 4;
F(n) = f(n/5) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], the function F(n)=-50?
The sign / - means the operation of integer division.


 

ID 39751. 16-16

The algorithm for calculating the value of the function F(n), where n – non-negative number, is given by the following relations:

F(0) = 5;
F(n) = n/3 + f(n/15) if n > 0, and the number n is a multiple of 15;
F(n) = n + 1 + f(n/2) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], the value F(n) is less than 100?
The sign / - means the operation of integer division.


 

ID 39752. 16-17

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 5;
F(n) = n/15 + f(n/3) if n > 0, and the number n is a multiple of 15;
F(n) = f(n-1) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], value  F(n) less than 100?
The sign / - means the operation of integer division.


 

ID 39753. 16-18

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 5;
F(n) = n/20 + f(n/8) if n > 0, and the number n is a multiple of 40;
F(n) = f(n/20) otherwise.

Determine how many distinct values n,  belonging to the segment [1, 1000000], the function F(n)=175?
The sign / - means the operation of integer division.


 

ID 39754. 16-19

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 15;
F(n) = n/5 + f(n/2) if n > 0, and the number n is a multiple of 20;
F(n) = f(n/3) otherwise.

Determine how many different values ​​the F(n) function takes on the segment [1, 1000000]?
The sign / - means the operation of integer division.



 

ID 39755. 16-29

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(0) = 7;
F(n) = n/7 + f(n/7) if n > 0, and the number n is a multiple of 7;
F(n) = f(n-1) otherwise.

Determine how many different values ​​the F(n) function takes on the segment [1, 1000000]?
The sign / - means the operation of integer division.



 

ID 39756. 16-20

The algorithm for calculating the value of the function F(n), where n – non-negative number, is given by the following relations:

F(0) = 9;
F(n) = n/3 + f(n/3) if n > 0, and the number n is a multiple of 9;
F(n) = n/2 + f(n/2) otherwise.

Determine how many different values ​​the F(n) function takes on the segment [1, 1000000]?
The sign / - means the operation of integer division.



 

ID 39773. 16-21

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n if n < 100;
F(n) = n + F(n/3), otherwise;
G(n) = n + 1 if n < 100;
G(n) = G(F(n/2)) otherwise.

Determine how many different values ​​the G(n) function takes on the segment [100, 100000]?
The sign / - means the operation of integer division.



 

ID 39775. 16-22

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n if n < 100;
F(n) = n + F(n/3), otherwise;
G(n) = n + 1 if n < 100;
G(n) = G(F(n/2)) otherwise.

Determine how many distinct values n,  belonging to the segment [100, 100000], the function G(n)=99?
The sign / - means integer division operation.


 

ID 39776. 16-23

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n + 10 if n < 10;
F(n) = n % 10 + G(F(n/10)), otherwise;
G(n) = n + 10 if n < 10;
G(n) = n % 10 + G(n/10), otherwise;

Determine how many different values ​​the F(n)function takes for all n smaller 1000000?
Sign / - means integer division operation. 
Sign % - means the operation of calculating the remainder of the division of two integers.




 

ID 39777. 16-24

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n + 10 if n < 10;
F(n) = n % 10 + G(F(n/10)), otherwise;
G(n) = n + 10 if n < 10;
G(n) = n % 10 + G(n/10), otherwise;

Determine how many different values n smaller 1000000, function F(n)=25?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.


 

ID 39778. 16-25

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n + 10 if n < 10;
F(n) = n % 10 + G(F(n/10)), otherwise;
G(n) = n + 10 if n < 10;
G(n) = n % 10 + G(n/10), otherwise;

Define the minimum value n,  where the function F(n)=30?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.


 

ID 39779. 16-26

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n + 10 if n < 10;
F(n) = n % 10 + G(F(n/10)), otherwise;
G(n) = n + 10 if n < 10;
G(n) = n % 10 + G(n/10), otherwise;

Determine the sum of all values ​​of the function F(n) for all values n smaller 1000000?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.


 

ID 39780. 16-27

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n % 10 if n < 100;
F(n) = n / 100 + G(n%100), otherwise;
G(n) = n % 10 if n < 100;
G(n) = n % 100 + F(n/100), otherwise;

Determine the sum of all values ​​of the function F(n), for all values n smaller 100000?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.


 

ID 39781. 16-28

The algorithm for calculating the value of the functions F(n) and G(n), where n – non-negative integer, is given by the following relations:

F(n) = n % 10 if n < 100;
F(n) = n / 100 + G(n%100), otherwise;
G(n) = n % 10 if n < 100;
G(n) = n % 100 + F(n/100), otherwise;

Determine the sum of all function values G(n), for all values n smaller 100000?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.



 

ID 39782. 16-30

The algorithm for calculating the value of the functions F(n)  and G(n), where n – natural number, given by the following relations:

F(n) = n + 10 if n < 10;
F(n) = n % 10 + G(F(n/10)), otherwise;
G(n) = n + 10 if n < 10;
G(n) = n % 10 + G(n/10), otherwise;

Determine the number of distinct values n, not exceeding 10⁶,  for which function F(n) is a multiple of 7?
The sign / - means integer division operation.
The sign % - means the operation of calculating the remainder when dividing two integers.


 

ID 39794. DV-2022

The figure shows a diagram of the roads of a certain region of the region in the form of a graph, the table shows the length of these roads in kilometers. The table and the diagram were drawn independently of each other, the numbering of the items in the table is in no way connected with the letter designations on the graph. Determine the sum of the side lengths between point A and point B, and between point F and point G.  ;Reply with an integer – as it is indicated in the table.
 

 

	P1	P2	P3	P4	P5	P6	P7
P1	x		11		10	7
P2		x	10			8
P3	11	10	x		13
P4				x		13	3
P5	10		13		x		5
P6	7	8		13		x
P7				3	5		x

ID 39803. DV-2022

When registering in a computer system, each object is assigned an identifier consisting of 250 characters. The identifier can contain decimal digits and characters from a special set of 1560 characters. The database stores information about each identifier with the same and the smallest possible integer number of bytes. In this case, character-by-character encoding of identifiers is used, all characters are encoded with the same and the minimum possible number of bits.

Determine the minimum amount of memory, in KB, that must be allocated to store identities for 32768 users.

ID 39806. DV-2022

The value of an arithmetic expression

ID 39807. DV-2022

The algorithm for calculating the value of the function F(n), where n – natural number, given by the following relations:

F(n) = 2 if n < 3;
F(n) = F(n - 1) + F(n - 2) - n if n > 2 and n even;
F(n) = F(n - 2) - F(n - 1) + 2n if n > 2 and n odd.

Determine what is the value of the function F(30)?

Write only an integer in your answer.


 

ID 39809. DV-2022

The square is lined with N × N cells (1 < N < 30). The Executor Robot can move around the cells by performing one of two commands in one move: right or down. right  command moves to the neighboring right cell, down – to the lower one. 
The square is bounded by outer walls. There can also be internal walls between adjacent square cells. The robot cannot pass through walls. 
Before each start of the Robot, in each cell of the square there is a coin with a value from 1 to 100. Having visited the cell, the Robot takes the coin with him; this also applies to the start and end cells of the Robot's route.
Determine the maximum and minimum amounts of money that the Robot can collect by going from the upper left cell to the lower right. In your answer, indicate two numbers – first the maximum amount, then the minimum.
Both numbers are specified on the same line, separated by one space.

The source data is a spreadsheet of  N × N, each cell of which corresponds to a square cell. Inner & nbsp;  outer walls are marked with thick lines.

ID 40146. June-1

In the figure, the road map of a certain area is shown as a graph; in the table, an asterisk indicates the presence of a road between settlements. 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 numbers of points D and E, write down the found numbers in ascending order without separators. For example, if the answer were points P1 and P6, then 16 would have to be indicated as an answer.
If there are several possible answers, indicate the one that has the lower numerical value.

 

	P1	P2	P3	P4	P5	P6
P1	x	*			*	*
P2	*	x	*			*
P3		*	x	*	*
P4			*	x	*	*
P5	*		*	*	x
P6	*	*		*		x

ID 40167. June-2

In the figure, the road map of the N 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 has nothing to do with the lettering on the graph. Determine the sum of the lengths of roads from point C to point D and from point E to point F.
Write an integer as your answer.
 

 

	P1	P2	P3	P4	P5	P6	P7
P1	x	27	24
P2	27	x	21		18
P3	24	21	x	15	12	9	30
P4			15	x		33
P5		18	12		x		36
P6			9	33		x	39
P7			30		36	39	x

 

ID 40169. June-2

The value of an arithmetic expression

ID 40172. June-2

The square is lined into NxN cells (1 < N < 17). The Executor Robot can move around the cells by performing one of four commands in one move: right, down, right by 2 , down 2. On a command to the right, the Robot moves to the adjacent right cell, on a command down – to the next lower one. On a command to the right by 2 - to the cell located two cells to the right, and on a command down to 2 - to the cell located two cells below.

The square is bounded by outer walls. There can also be internal walls between adjacent cells of a square. The robot cannot pass through the wall. Before each start of the Robot, in each cell of the square there is a coin with a value from 1 to 100. Having visited the cell, the Robot takes the coin with him; this also applies to the start and end cells of the Robot's route.

Determine the maximum and minimum amounts of money that the Robot can collect by going from the upper left cell to the lower right one. Answer two numbers — first the maximum amount, then the minimum.

The source data is a spreadsheet of size N × N, each cell of which corresponds to a square cell. The inner and outer walls are marked with thick lines.

ID 45187. Turtle-1-1

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 67 [Forward 10 Right 20]

ID 45208. Turtle-1-2

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 76 [Forward 5 Right 6]

ID 45209. Turtle-1-3

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 70 [Forward 10 Right 9]

ID 45210. Turtle-1-4

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 60 [Forward 10 Right 18]

ID 45211. Turtle-1-5

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 54 [Forward 7 Right 90]

ID 45212. Turtle-1-6

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 33 [Forward 8 Right 24]

ID 45213. Turtle-1-7

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 69 [Forward 6 Right 12]

ID 45214. Turtle-1-8

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 46 [Forward 9 Right 90]

ID 45215. Turtle-1-9

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 77 [Forward 10 Right 12]

ID 45216. Turtle-1-10

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 116 [Forward 9 Right 4]

ID 45217. Turtle-2-1

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 58 [Forward 5 Right 40]

ID 45218. Turtle-2-2

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 49 [Forward 5 Right 36]

ID 45219. Turtle-2-3

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 45 [Forward 3 Right 40]

ID 45220. Turtle-2-4

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 39 [Forward 3 Right 45]

ID 45221. Turtle-2-5

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 34 [Forward 5 Right 72]

ID 45222. Turtle-2-6

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 23 [Forward 3 Right 45]

ID 45223. Turtle-2-7

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 42 [Forward 4 Right 36]

ID 45224. Turtle-2-8

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 40 [Forward 4 Right 90]

ID 45225. Turtle-2-9

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 36 [Forward 3 Right 90]

ID 45226. Turtle-2-10

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the appropriate direction,  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise respectively.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 21 [Forward 4 Right 36]

ID 45227. Turtle-3-1

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 6 [Forward 4 Right 90 Forward 5 Right 90]
Raise your tail
Forward 3 Right 90 Forward 1 Left 90
Lower your tail
Repeat 12[Forward 10 Left 90]

ID 45228. Turtle-3-2

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 2 [Forward 2 Right 90 Forward 9 Right 90]
Raise your tail
Forward 1 Right 90 Forward 1 Left 90
Lower your tail
Repeat 4[Forward 9 Left 90]

ID 45229. Turtle-3-3

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 2 [Forward 4 Right 90 Forward 7 Right 90]
Raise your tail
Forward 4 Right 90 Forward 2 Left 90
Lower your tail
Repeat 4[Forward 9 Left 90]

ID 45230. Turtle-3-4

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 2 [Forward 8 Right 90 Forward 5 Right 90]
Raise your tail
Forward 1 Right 90 Forward 3 Left 90
Lower your tail
Repeat 4[Forward 8 Left 90]

ID 45231. Turtle-3-5

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 4 [Forward 8 Right 90 Forward 9 Right 90]
Raise your tail
Forward 2 Right 90 Forward 4 Left 90
Lower your tail
Repeat 8[Forward 10 Left 90]

ID 45232. Turtle-3-9

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 4 [Forward 9 Right 90 Forward 1 Right 90]
Raise your tail
Forward 3 Right 90 Forward 2 Left 90
Lower your tail
Repeat 8[Forward 8 Left 90]

ID 45233. Turtle-3-6

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 2 [Forward 9 Right 90 Forward 6 Right 90]
Raise your tail
Forward 2 Right 90 Forward 1 Left 90
Lower your tail
Repeat 4[Forward 9 Left 90]

ID 45234. Turtle-3-7

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 4 [Forward 9 Right 90 Forward 2 Right 90]
Raise your tail
Forward 5 Right 90 Forward 5 Left 90
Lower your tail
Repeat 8[Forward 9 Left 90]

ID 45235. Turtle-3-8

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 6 [Forward 1 Right 90 Forward 8 Right 90]
Raise your tail
Forward 5 Right 90 Forward 5 Left 90
Lower your tail
Repeat 12[Forward 8 Left 90]

ID 45236. Turtle-3-10

The performer Turtle acts on a plane with a Cartesian coordinate system. At the initial moment, the Turtle is at the origin of coordinates, its head is directed along the positive direction of the y-axis, the tail is lowered. With the tail lowered, the Turtle leaves a trail in the form of a line on the field. At each specific moment, the position of the performer and the direction of his movement are known.
The performer has commands: Forward n and Back n (where n – is an integer), causing the Turtle to move by n units in the corresponding direction;  Right m and Left m (where m – is an integer) causing the direction to change to m degrees clockwise  or counterclockwise, respectively; Raise tail, indicating the transition to move without drawing; Lower tail, indicating the transition to paint mode.

Recording

Repeat k [Command1 Command2 … CommandS]

Repeat 6 [Forward 10 Right 90 Forward 9 Right 90]
Raise your tail
Forward 3 Right 90 Forward 2 Left 90
Lower your tail
Repeat 12[Forward 7 Left 90]