Codeforces Beta Round 99 (Div. 2)

2 problems from Codeforces Beta Round 99 (Div. 2) (contest 139), difficulty 1000-1600. 2/2 solutions verified against sample I/O.

2 items

Codeforces Beta Round 99 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1600 | 2m 53s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Petr and Book	1000	implementation	37,492	1m 26s	✓
B	Wallpaper	1600	implementation, math	1,460	1m 27s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 2) ›

CF 139A - Petr and Book

Petr has a book with n pages. Starting from Monday, he reads a fixed number of pages each day of the week. The input gives those seven daily reading capacities in order from Monday to Sunday. We need to determine on which day Petr finishes the book.

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 2) ›

CF 139B - Wallpaper

We are asked to compute the minimum cost to paper all walls in an apartment where each room is a rectangular prism. For each room, the length, width, and height are given. The perimeter of a room determines how many strips of wallpaper are needed.