Codeforces Beta Round 67 (Div. 2)

Solutions for Codeforces Beta Round 67 (Div. 2) (contest 75). 4/5 problems verified against sample I/O. Difficulty range: 1000-2400.

5 items

Codeforces Beta Round 67 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1000-2400 | Time: 9m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Life Without Zeros	1000	implementation	1m 34s	✓
B	Facetook Priority Wall	1500	expression-parsing, implementation, strings	2m 14s	✗
C	Modified GCD	1600	binary-search, number-theory	1m 40s	✓
D	Big Maximum Sum	2000	data-structures, dp, greedy	1m 34s	✓
E	Ship's Shortest Path	2400	geometry, shortest-paths	2m 29s	✓

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

CF 75A - Life Without Zeros

We are given two positive integers, a and b. First we compute their normal sum c = a + b. Then we apply the same transformation to all three numbers: remove every digit 0 from their decimal representation. The question is whether the transformed equation still holds.

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

CF 75B - Facetook Priority Wall

We are given the name of a user on a social network and a sequence of activity messages between users. Every activity contributes a certain number of points between the two people involved.

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

CF 75C - Modified GCD

We are given two positive integers, and then many range queries. For each query [low, high], we must find the largest integer inside that interval that divides both numbers. The first observation is that we are not really working with a and b independently.

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

CF 75D - Big Maximum Sum

We are given a set of small arrays and a sequence of indexes indicating how to concatenate them into one larger array. Once the large array is built in this way, the goal is to find the maximum sum of a contiguous subarray.

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

CF 75E - Ship's Shortest Path

We are given two points in the plane, the ship's starting position and destination, together with a convex polygon representing an island. Moving through the sea costs 1 per unit distance. Moving through the interior of the island costs 2 per unit distance.