Codeforces Beta Round 4 (Div. 2 Only)

Solutions for Codeforces Beta Round 4 (Div. 2 Only) (contest 4). 4/4 problems verified against sample I/O. Difficulty range: 800-1700.

4 items

Codeforces Beta Round 4 (Div. 2 Only)

Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 800-1700 | Time: 4m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Watermelon	800	brute-force, math	46s	✓
B	Before an Exam	1200	constructive-algorithms, greedy	1m 12s	✓
C	Registration System	1300	data-structures, hashing, implementation	1m 42s	✓
D	Mysterious Present	1700	dp, sortings	1m 17s	✓

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

CF 4A - Watermelon

The problem gives a single integer w, the weight of a watermelon. We need to decide whether it can be split into two positive parts such that both parts are even numbers.

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

CF 4C - Registration System

We are building a username registration system. Every incoming request contains a desired username. If that username has never appeared before, registration succeeds immediately and we print OK.

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

CF 4D - Mysterious Present

We are given a collection of envelopes, each with a width and height. A postcard already has fixed dimensions, and we want to build the longest possible nesting chain of envelopes such that:

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

We are given d days and a target total number of study hours, sumTime. For every day, Peter must study at least minTime[i] hours and at most maxTime[i] hours. The task is to construct any valid schedule whose total sum is exactly sumTime.

Codeforces Beta Round 4 (Div. 2 Only)

Codeforces Beta Round 4 (Div. 2 Only)

CF 4A - Watermelon

CF 4C - Registration System

CF 4D - Mysterious Present

CF 4B - Before an Exam