Codeforces Round 736 (Div. 2)

2 problems from Codeforces Round 736 (Div. 2) (contest 1549), difficulty 800-800. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 736 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 800-800 | 11m 31s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Gregor and Cryptography	800	math, number-theory	35,559	3m 41s
B	Gregor and the Pawn Game	800	dfs-and-similar, dp, flows	26,817	7m 50s

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

CF 1549B - Gregor and the Pawn Game

We are given a square board of size $n times n$, but only the first and last rows matter. The bottom row contains Gregor’s pawns, and the top row contains enemy pawns. Every column is either empty or occupied independently in those two rows.

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

CF 1549A - Gregor and Cryptography

We are given a prime number $P$, and for each test case we must output two integers $a$ and $b$ such that both lie between 2 and $P$, with $a < b$, and the remainders when dividing $P$ by $a$ and by $b$ are equal.