Miradil Zeynallimmzeynalli.hashnode.dev·Oct 11, 2023Solving DSA Problems. Eolymp 325: Dangerous routeProblem statement In one country there are n cities, some of which are connected by two-way routes. Cities are numbered by integers from 1 to n. In times of financial crisis the level of the crime in a state rose and the crime groups are organized. T...DSA
Miradil Zeynallimmzeynalli.hashnode.dev·Oct 6, 2023Solving DSA Problems. Eolymp 87: RobotProblem statement The infinite in both directions stripe with width 1 is divided into blocks of size 1 x 1. In one of these blocks the robot is located. It can move from one cell to another (the robot at the figure is marked with square). Its movemen...eolymp
