Solving the problem of finding a Hamiltonian cycle.
To test your solutions, use Example.in and to make sure that the time or memory limit is not exceeded by you, send the solution to the system.
After the contest is over, the jury will check the last Accepted Submission for each participant on the closed final test and publish the final scores.

For the convenience of checking strategies, use the visualizer
you need to pass the output of your program to it

Go to the competition page

Solving the problem of finding a Hamiltonian path.
To test your solutions, use Example.in and to make sure that the time or memory limit is not exceeded by you, send the solution to the system.
After the contest is over, the jury will check the last Accepted Submission for each participant on the closed final test and publish the final scores.

For the convenience of checking strategies, use the visualizer - https://atstng.github.io/HamiltonianPathSolVisualizer/
you need to pass the output of your program to it

Go to the competition page

Solving the optimization problem of finding the optimal path.

Go to the competition page