Codeforces Round 639 (Div. 2)

2 problems from Codeforces Round 639 (Div. 2) (contest 1345), difficulty 800-1100. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 639 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1100 | 9m 6s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Puzzle Pieces	800	math	24,827	1m 48s	✓
B	Card Constructions	1100	binary-search, brute-force, dp	28,237	7m 18s	✓

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

CF 1345B - Card Constructions

We are given a supply of identical cards and we repeatedly build structures called pyramids. A pyramid of height 1 is the smallest possible structure, and every higher pyramid is built in layers: a taller pyramid consists of a smaller pyramid placed on top of a wider base made…

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

CF 1345A - Puzzle Pieces

We are asked to determine whether a grid of jigsaw pieces can be assembled given a special piece design. Each piece has exactly three tabs and one blank. The pieces can be rotated in any orientation.