Codeforces Beta Round 61 (Div. 2)

Solutions for Codeforces Beta Round 61 (Div. 2) (contest 66). 3/5 problems verified against sample I/O. Difficulty range: 1100-2000.

5 items

Codeforces Beta Round 61 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2000 | Time: 9m 20s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Petya and Java	1300	implementation, strings	1m 33s	✓
B	Petya and Countryside	1100	brute-force, implementation	1m 25s	✓
C	Petya and File System	1800	data-structures, implementation	2m 13s	✓
D	Petya and His Friends	1700	constructive-algorithms, math, number-theory	1m 57s	✗
E	Petya and Post	2000	data-structures, dp	2m 12s	✗

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

CF 66A - Petya and Java

We are given a decimal integer as a string. The number can be extremely large, up to 100 digits long, so it may not fit into normal integer types in many programming languages. The task is to determine the smallest Java integer type that can store this value.

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

CF 66B - Petya and Countryside

We have a garden represented as a one-dimensional array of sections, each with a fixed height. Petya can create artificial rain above exactly one section, and water will flow to neighboring sections as long as their height is less than or equal to the section the water comes…

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

CF 66C - Petya and File System

Each input line describes the full path of one file inside a file system. A path looks like: The disk name is the root and is not considered a folder. Every component between the disk and the file is a folder. The last component is always a file.

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

CF 66D - Petya and His Friends

We need to construct n distinct positive integers with two simultaneous properties. First, every pair of numbers must share a common divisor larger than 1. In other words, for every pair (ai, aj), their gcd cannot equal 1. Second, the gcd of the entire set must equal 1.

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

CF 66E - Petya and Post

We have a circular route with n post offices, each with a gas station. Each station i has a[i] liters of gasoline available, and the distance from station i to i+1 is b[i] kilometers, wrapping around at the end.