The Domino Head

C & C++ — incorrectly specified categories?

34 USD

Project translated automatically. Log in or register, to view the original C++, Visual Studio Code (first course) In our case, the domain headset is a two-dimensional massive, 8 in depth and 7 in width, filled with numbers from 0 to 6.The task is to unite the numbers into a pair horizontal or vertical so that 28 numbers pair (i.e. the whole matrix broke into a pair of numbers) forms so that no pair is repeated.The performance algorithm consists in starting from the left upper edge to unite the numbers into a pair on the horizon until the same pair is met (therefore it will no longer be unique), in this case you should try to place the dome on the vertical, and if so the pair will not be unique, ( !) you need to perform the backtracking function - to go back on the massive to the past such a domain and change its position, between them, logically, all the domain must be removed.This is a recursion that will be carried out until the entire matrix is filled with 28 unique numbers.According to the code structure: a few structures, a class with methods, you can use a list of vectors to store the domain.To the photo task, example and three tables of the domain you need to solve

Proposals 5

Dmitriy Musenko

5 0

Projects 5
Rating -
Rating 280

Budget: 1500 UAH Deadline: 1 day

Good evening . I’m familiar with your project and ready to approach it with the greatest responsibility, and to implement it in the shortest time possible.

Andriy I.

156 5

Budget: 1500 UAH Deadline: 7 days

Good day .
I am happy to do my task quickly and quickly.

The list does not show proposals concealed by the client or freelancer with a Plus profile, as well as proposals violating rules

Artem Khvorostianyi
Kyiv, Ukraine

Projects -
Rating -
Rating 65