1
Галина
no recommendations
no complaints
Project title: Solve problems in Python
Type of cooperation: Periodic employment
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Electronic money
Acceptance of requests: from 2019-12-08 until 2019-12-09
Type of cooperation: Periodic employment
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Electronic money
Acceptance of requests: from 2019-12-08 until 2019-12-09
Project description:
We need a Python expert. You must solve problems in Python, with the limitations specified in the condition.
1. A sequence of natural numbers not exceeding 20,000 is introduced. Zero is the sign of the end. It is required to deduce the minimum of the product of two elements of the sequence, which is divided by 22. The multipliers that make up the product can be
equal if a number is more in sequence
Once. If the required product is not available, then withdraw
The minimum product of two elements is
Stee. It is guaranteed that there will be at least two in the sequence.
Elements. Toolkit
(e.g., the squatters), do not use them.
2. At the entrance to the program is fed a sequence of integers, each of which does not exceed the module 10000. Numbers are written in a single line through a space. The sign of the end of the input (not included in the sequence) is the number 2*109. It is required to find and derive the maximum odd product of two elements of the sequence that are located at a distance of at least 5 (between them there must be at least four other elements of the sequence). It is guaranteed that there will be at least six elements in the sequence. If the desired odd work does not exist, then output the message IMPOSSIBLE. Tools, such as arrays, should not be used.
3. A sequence of whole numbers is introduced. Zero is a sign
The end. The numbers on the module do not exceed 20,000. To determine, is
This sequence is an arithmetic progression.
Input the answer as YES or NO.
We need a Python expert. You must solve problems in Python, with the limitations specified in the condition.
1. A sequence of natural numbers not exceeding 20,000 is introduced. Zero is the sign of the end. It is required to deduce the minimum of the product of two elements of the sequence, which is divided by 22. The multipliers that make up the product can be
equal if a number is more in sequence
Once. If the required product is not available, then withdraw
The minimum product of two elements is
Stee. It is guaranteed that there will be at least two in the sequence.
Elements. Toolkit
(e.g., the squatters), do not use them.
2. At the entrance to the program is fed a sequence of integers, each of which does not exceed the module 10000. Numbers are written in a single line through a space. The sign of the end of the input (not included in the sequence) is the number 2*109. It is required to find and derive the maximum odd product of two elements of the sequence that are located at a distance of at least 5 (between them there must be at least four other elements of the sequence). It is guaranteed that there will be at least six elements in the sequence. If the desired odd work does not exist, then output the message IMPOSSIBLE. Tools, such as arrays, should not be used.
3. A sequence of whole numbers is introduced. Zero is a sign
The end. The numbers on the module do not exceed 20,000. To determine, is
This sequence is an arithmetic progression.
Input the answer as YES or NO.
