[b]p1.[/b] Suppose $\frac{x}{y} = 0.\overline{ab}$ where $x$ and $y$ are relatively prime positive integers and $ab + a + b + 1$ is a multiple of $12$. Find the sum of all possible values of $y$.


[b]p2.[/b] Let $A$ be the set of points $\{(0, 0), (2, 0), (0, 2),(2, 2),(3, 1),(1, 3)\}$. How many distinct circles pass through at least three points in $A$?


[b]p3.[/b] Jack and Jill need to bring pails of water home. The river is the $x$-axis, Jack is initially at the point $(-5, 3)$, Jill is initially at the point $(6, 1)$, and their home is at the point $(0, h)$ where $h > 0$. If they take the shortest paths home given that each of them must make a stop at the river, they walk exactly the same total distance. What is $h$?


[b]p4.[/b] What is the largest perfect square which is not a multiple of $10$ and which remains a perfect square if the ones and tens digits are replaced with zeroes?


[b]p5.[/b] In convex polygon $P$, each internal angle measure (in degrees) is a distinct integer. What is the maximum possible number of sides $P$ could have?


[b]p6.[/b] How many polynomials $p(x)$ of degree exactly $3$ with real coefficients satisfy $$p(0), p(1), p(2), p(3) \in \{0, 1, 2\}?$$


[b]p7.[/b] Six spheres, each with radius $4$, are resting on the ground. Their centers form a regular hexagon, and adjacent spheres are tangent. A seventh sphere, with radius $13$, rests on top of and is tangent to all six of these spheres. How high above the ground is the center of the seventh sphere?


[b]p8.[/b] You have a paper square. You may fold it along any line of symmetry. (That is, the layers of paper must line up perfectly.) You then repeat this process using the folded piece of paper. If the direction of the folds does not matter, how many ways can you make exactly eight folds while following these rules? 


[b]p9.[/b] Quadrilateral $ABCD$ has $\overline{AB} = 40$, $\overline{CD} = 10$, $\overline{AD} = \overline{BC}$, $m\angle BAD = 20^o$, and $m \angle ABC = 70^o$. What is the area of quadrilateral $ABCD$?


[b]p10.[/b] We say that a permutation $\sigma$ of the set $\{1, 2,..., n\}$ preserves divisibilty if $\sigma (a)$ divides $\sigma (b)$ whenever $a$ divides $b$. How many permutations of $\{1, 2,..., 40\}$  preserve divisibility? (A permutation of $\{1, 2,..., n\}$ is a function $\sigma$ from $\{1, 2,..., n\}$ to itself such that for any $b \in \{1, 2,..., n\}$, there exists some $a \in \{1, 2,..., n\}$ satisfying $\sigma (a) = b$.)


[b]p11.[/b] In the diagram shown at right, how many ways are there to remove at least one edge so that some circle with an “A” and some circle with a “B” remain connected? 
[img]https://cdn.artofproblemsolving.com/attachments/8/7/fde209c63cc23f6d3482009cc6016c7cefc868.png[/img]

[b]p12.[/b] Let $S$ be the set of the $125$ points in three-dimension space of the form $(x, y, z)$ where $x$, $y$, and $z$ are integers between $1$ and $5$, inclusive. A family of snakes lives at the point $(1, 1, 1)$, and one day they decide to move to the point $(5, 5, 5)$. Snakes may slither only in increments of $(1,0,0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Given that at least one snake has slithered through each point of $S$ by the time the entire family has  reached $(5, 5, 5)$, what is the smallest number of snakes that could be in the family?


PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
To determine the number of distinct circles that pass through at least three points in the set \( A = \{(0, 0), (2, 0), (0, 2), (2, 2), (3, 1), (1, 3)\} \), we need to consider the geometric properties and configurations of these points.

1. **Identify Collinear Points**:
   - First, we check if any three points are collinear. If three points are collinear, they cannot form a circle.
   - The points \((1, 3)\), \((2, 2)\), and \((3, 1)\) lie on the line \(x + y = 4\). Therefore, these three points are collinear and cannot form a circle.

2. **Calculate Total Combinations**:
   - The total number of ways to choose three points from six is given by the binomial coefficient:
     \[
     \binom{6}{3} = 20
     \]

3. **Subtract Collinear Combinations**:
   - Since the points \((1, 3)\), \((2, 2)\), and \((3, 1)\) are collinear, we subtract this one combination:
     \[
     20 - 1 = 19
     \]

4. **Identify Overlapping Circles**:
   - Next, we need to check for any sets of points that form the same circle.
   - The points \((0, 0)\), \((2, 0)\), \((2, 2)\), and \((0, 2)\) form a square. Any three of these four points will lie on the same circle (the circumcircle of the square).
   - There are \(\binom{4}{3} = 4\) ways to choose three points from these four. Since they all lie on the same circle, we have over-counted by 3:
     \[
     19 - 3 = 16
     \]

5. **Check for Other Circles**:
   - The points \((2, 0)\), \((3, 1)\), \((1, 3)\), and \((0, 2)\) form a rectangle. Any three of these four points will lie on the same circle (the circumcircle of the rectangle).
   - There are \(\binom{4}{3} = 4\) ways to choose three points from these four. Since they all lie on the same circle, we have over-counted by 3:
     \[
     16 - 3 = 13
     \]

Thus, the number of distinct circles that pass through at least three points in the set \( A \) is \( 13 \).

The final answer is \(\boxed{13}\).