Codeforces Beta Round 79 (Div. 2 Only)

Solutions for Codeforces Beta Round 79 (Div. 2 Only) (contest 102). 2/2 problems verified against sample I/O. Difficulty range: 1000-1200.

2 items

Codeforces Beta Round 79 (Div. 2 Only)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1200 | Time: 3m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Clothes	1200	brute-force	1m 42s	✓
B	Sum of Digits	1000	implementation	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.