Codeforces Beta Round 51

Solutions for Codeforces Beta Round 51 (contest 55). 3/5 problems verified against sample I/O. Difficulty range: 1200-2500.

5 items

Codeforces Beta Round 51

Type: Beta | Problems: 5 | Verified: 3/5 | Rating range: 1200-2500 | Time: 10m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Flea travel	1200	implementation, math	1m 24s	✓
B	Smallest number	1600	brute-force	1m 47s	✓
C	Pie or die	1900	games	1m 43s	✓
D	Beautiful numbers	2500	dp, number-theory	3m 29s	✗
E	Very simple problem	2500	geometry, two-pointers	1m 49s	✗

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55A - Flea travel

We have n positions arranged in a circle. The flea starts on one position. After the first minute it moves forward by 1 step, after the second minute by 2 steps, after the third minute by 3 steps, and so on.

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55B - Smallest number

We start with four integers on the board. We also know the exact sequence of three operations that must be applied, where each operation is either addition or multiplication.

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55C - Pie or die

We have an grid. Some cells contain pies, and several pies may share the same cell.

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55D - Beautiful numbers

We are asked to count numbers in given ranges that Volodya would call beautiful. A number is beautiful if it is divisible by each of its nonzero digits. For example, 128 is beautiful because 128 is divisible by 1, 2, and 8.

Practice › Codeforces Solutions › Codeforces Beta Round 51 ›

CF 55E - Very simple problem

We are given a convex polygon defined by a list of points in clockwise order. For each query point in the plane, we need to count how many triangles formed by the polygon’s vertices contain that point strictly inside.