Codeforces Beta Round 79 (Div. 2 Only)

2 problems from Codeforces Beta Round 79 (Div. 2 Only) (contest 102), difficulty 1000-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Beta Round 79 (Div. 2 Only)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1200 | 3m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Clothes	1200	brute-force	3,420	1m 42s	✓
B	Sum of Digits	1000	implementation	31,927	1m 54s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 79 (Div. 2 Only) ›

CF 102A - Clothes

We are asked to find the cheapest way for Gerald to buy three pieces of clothing that all match each other. Each clothing item has a price, and some pairs of items are marked as matching. The input gives us the total number of items, the prices, and a list of matching pairs.

Practice › Codeforces Solutions › Codeforces Beta Round 79 (Div. 2 Only) ›

CF 102B - Sum of Digits

The problem asks us to repeatedly replace a number with the sum of its digits until the number becomes a single-digit number. The input is a number n that can be extremely large, up to 10 million digits.