add README.md file
This commit is contained in:
parent
f06aaf91f3
commit
81cc1496ae
35
README.md
Normal file
35
README.md
Normal file
@ -0,0 +1,35 @@
|
|||||||
|
# __Tasks for the intership__
|
||||||
|
|
||||||
|
There are 3 tasks for the intership in this repo
|
||||||
|
|
||||||
|
## [Tasks 1](/task1)
|
||||||
|
Here you can find the [task1.py](/task1/task1.py)
|
||||||
|
|
||||||
|
|
||||||
|
The essence of the task was:
|
||||||
|
|
||||||
|
> Write a program that outputs a path along which, moving with an interval of length m through
|
||||||
|
a given array, the end will be the first element.
|
||||||
|
The beginning of one interval is the end of the previous one. The path is an array of the initial elements of the obtained intervals. \
|
||||||
|
Ex 1: n = 4, m = 3 (1234 --> _1_23, _3_41)
|
||||||
|
Output: 13
|
||||||
|
|
||||||
|
|
||||||
|
## [Tasks 3](/task3)
|
||||||
|
Here you can find the:
|
||||||
|
- [task3.py](/task3/task3.py) - The pyfile with task;
|
||||||
|
- [tests.json](/task3/tests.json) - contains a structure for building a report based on past tests. The jsonfile with the following keys: 'tests, 'id', 'title', 'value' ('values');
|
||||||
|
- [values.json](/task3/values.json) - contains test results with unique id. The jsonfile with the following keys: 'id', 'value'
|
||||||
|
- [report.json](/task3/report.json) - The jsonfile with the join result of 2 previous jsonfiles, which are joined by 'id', and the values are substituted in place of the 'value' keys
|
||||||
|
|
||||||
|
The essence of the task was:
|
||||||
|
> Two files are sent to the input as arguments of the program: tests.json and values.json. Write a program that generates a report file.json with filled in value fields for the tests structure.json based on values.json.
|
||||||
|
|
||||||
|
|
||||||
|
## [Tasks 4](/task4)
|
||||||
|
Here you can find the:
|
||||||
|
- [task4.py](/task4/task4.py) - The pyfile with task;
|
||||||
|
- [file.txt](/task4/file.txt) - contains the array elements fot the tasks;
|
||||||
|
|
||||||
|
The essence of the task was:
|
||||||
|
> An array of integers nums is given. Write a program that outputs the minimum number of moves required to reduce all elements to one number. In one move, you can decrease or increase the number of the array by 1.
|
Loading…
Reference in New Issue
Block a user