Mathematics, Competitive Programming, Philosophy, Discrete Mathematics.
This completes the proof of our near-perfect 3*m bound. 1.5 A perfect bound The 3*m bound on the number of repaintings is nearly-perfect since we can get 3*m-2 repaintings as shown in Figure 3 below (as long as n is at least 2*m-1). Can we modify the argument to obtain a perfect bound? Figure 3: An