Codeforces Round 124 (Div. 2)

2 problems from Codeforces Round 124 (Div. 2) (contest 197), difficulty 1400-1600. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 124 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1400-1600 | 2m 55s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Plate Game	1600	constructive-algorithms, games, math	6,844	1m 22s	✓
B	Limit	1400	math	4,917	1m 33s	✓

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 2) ›

CF 197A - Plate Game

We have a rectangular table with dimensions a × b and an unlimited supply of identical circular plates with radius r. Two players alternate placing plates on the table. Every plate must lie completely inside the rectangle, and plates may touch but cannot overlap.

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 2) ›

CF 197B - Limit

We are given two polynomials, $P(x)$ and $Q(x)$, written in descending powers of $x$. The task is to compute: $$lim{x to infty} frac{P(x)}{Q(x)}$$ The input gives the degrees of the two polynomials and all coefficients from the highest-degree term down to the constant term.