Brookfield Computer Programming Challenge 1

8 problems from Brookfield Computer Programming Challenge 1 (contest 102680), difficulty -. 8/8 solutions verified against sample I/O.

8 items

Brookfield Computer Programming Challenge 1

Special | 8 problems | 8/8 verified | Difficulty - | 15m 1s

#	Problem	Time	✓
A	Passing Bills	1m 2s	✓
B	Apple Pen	1m 27s	✓
C	The Halting Problem	2m 23s	✓
D	One	1m 2s	✓
E	Negigent Norbert	1m 10s	✓
F	Calculatus Eliminatus	1m 45s	✓
G	Bike Race	3m 18s	✓
H	Last Robotics	2m 54s	✓

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680G - Bike Race

The problem describes a connected undirected road network. Each intersection is a vertex and each road is an edge. The three racers want to choose a starting intersection and a finishing intersection.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680C - The Halting Problem

The program in this problem is a very small artificial machine. It has a single 8-bit register r, so the register can only contain values from 0 to 255. Execution starts at the first instruction with r = 0.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680A - Passing Bills

The problem is intentionally wrapped in a long story, but the actual computation is extremely small. The committee considers a session containing n bills. Every bill that reaches a vote receives unanimous approval, so every voted bill is passed.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680H - Last Robotics

The problem defines an infinite sequence of alliance colors. It starts with a single red team. To create the next version of the sequence, we copy the current sequence, swap every color in the copy, and append that copy to the end.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680F - Calculatus Eliminatus

The problem describes a line of positions numbered from 1 to n. Some ranges of positions are eliminated, meaning they cannot contain the missing object. After all given ranges are removed, exactly one position remains possible. The task is to find that remaining position.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680E - Negigent Norbert

Norbert has to answer a number of clarification requests. Every answer must be a non-empty string, and no two answers may be identical.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680D - One

The task is to classify each given natural number. A number is Prime if its only positive divisors are 1 and itself. It is Composite if it has at least one additional divisor. The special value 1 belongs to neither category because it has only one positive divisor.

Practice › Codeforces Solutions › Brookfield Computer Programming Challenge 1 ›

CF 102680B - Apple Pen

The problem describes an operation called "uh". If an item A is uh-ed with an item B, the result is a new item whose name is B-A, meaning the second item is placed before the first item with a hyphen between them.