Vrijeme: 10:31
Ukrainski lanac | Ukraine chain #1
Informatičar Taras radi u programu koji se zove "Paint Desk". Pa, ne radi baš, već radije pokušava nacrtati ploču 
(sa svim granicama svih 
malih kvadratića) u najmanjem mogućem broju poteza. U jednom potezu može nacrtati granicu nekog pravokutnika. Koji je najmanji broj poteza potreban za postizanje cilja?
(sa svim granicama svih malih kvadratića) u najmanjem mogućem broju poteza. U jednom potezu može nacrtati granicu nekog pravokutnika. Koji je najmanji broj poteza potreban za postizanje cilja?(npr. ako bi crtao ploču 
(sa svim granicama malih kvadrata), trebala bi mu dva poteza.)
An IT guy Taras is working in the program called "Paint Desk". Well, not really working but rather attempting to draw a board (with all the boundaries of all the little squares) in the smallest number of moves possible. In one move he can draw a boundary of some rectangle. What is the smallest number of moves required to achieve the goal?
(with all the boundaries of all the little squares) in the smallest number of moves possible. In one move he can draw a boundary of some rectangle. What is the smallest number of moves required to achieve the goal?(e.g. if he were to draw a board (with all the little squares boundaries), he would need two moves.)