olymmath

RIOPLATENSE 1999 Problem 3

    Two players AA and BB play the following game: AA chooses a point, with integer coordinates, on the plane and colors it green, then BB chooses 1010 points of integer coordinates, not yet colored, and colors them yellow. The game always continues with the same rules; AA and BB choose one and ten uncolored points and color them green and yellow, respectively. a. The objective of AA is to achieve 1112111^2 green points that are the intersections of 111111 horizontal lines and 111111 vertical lines (parallel to the coordinate axes). BB 's goal is to stop him. Determine which of the two players has a strategy that ensures you achieve your goal. b. The objective of AA is to achieve 44 green points that are the vertices of a square with sides parallel to the coordinate axes. BB 's goal is to stop him. Determine which of the two players has a strategy that will ensure that they achieve their goal.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator rioplatense/1999/p3 · Tag SEG9HMCH5B · Edit this page on GitHub · Keys: j next, k previous