Codeforces Round 279 (Div. 2)

Solutions for Codeforces Round 279 (Div. 2) (contest 490). 0/5 problems verified against sample I/O. Difficulty range: 1500-2200.

5 items

Codeforces Round 279 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 1500-2200 | Time: 44m 5s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Queue	1500	dsu, implementation	11m 48s	✗
C	Hacking Cypher	1700	brute-force, math, number-theory	5m 25s	✗
D	Chocolate	1900	brute-force, dfs-and-similar, math	5m 18s	✗
E	Restoring Increasing Sequence	2000	binary-search, brute-force, greedy	10m 45s	✗
F	Treeland Tour	2200	data-structures, dfs-and-similar, dp	10m 49s	✗

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490B - Queue

Each line of input describes one student. For that student we know two IDs: a is the student standing immediately in front of him. b is the student standing immediately behind him. If one of those neighbors does not exist, the value is 0.

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490C - Hacking Cypher

Codeforces 490C: Hacking Cypher

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490D - Chocolate

Codeforces 490D: Chocolate

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490E - Restoring Increasing Sequence

We are given a sequence of positive integers written on the board, but some of the digits have been replaced by question marks. Each question mark represents a lost digit, so our task is to restore the sequence to a strictly increasing list of positive integers.

Practice › Codeforces Solutions › Codeforces Round 279 (Div. 2) ›

CF 490F - Treeland Tour

We are given a tree with n cities, each with a known population. The tree is described by n-1 bidirectional roads connecting the cities.