Codeforces Beta Round 5

5 problems from Codeforces Beta Round 5 (contest 5), difficulty 1000-2400. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 5

Beta | 5 problems | 5/5 verified | Difficulty 1000-2400 | 5m 59s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Chat Servers Outgoing Traffic	1000	implementation	11,120	1m 9s	✓
B	Center Alignment	1200	implementation, strings	6,760	1m 24s	✓
C	Longest Regular Bracket Sequence	1900	constructive-algorithms, data-structures, dp	18,060	1m 21s	✓
D	Follow Traffic Rules	2100	implementation, math	1,936	54s	✓
E	Bindian Signalizing	2400	data-structures	2,487	1m 11s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5A - Chat Servers Outgoing Traffic

We are given a sequence of chat server events. A user can join the chat, leave the chat, or send a message. Every time someone sends a message, the server delivers that message to every user currently inside the chat, including the sender.

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5B - Center Alignment

We are given several lines of text. Every line may contain letters, digits, and spaces inside the line, but never at the beginning or end. The task is to print all lines inside a rectangular frame made of * characters.

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5C - Longest Regular Bracket Sequence

We are given a string made only of ( and ). Among all contiguous substrings, we need to find the maximum length of a substring that forms a valid bracket sequence. We also need to count how many substrings achieve that maximum length.

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5D - Follow Traffic Rules

We are asked to compute the minimum travel time for a car moving along a straight road from Berland to Bercouver. The road has length _l_, and at a distance _d_ from the start there is a speed sign that limits the car's instantaneous speed to _w_.

Practice › Codeforces Solutions › Codeforces Beta Round 5 ›

CF 5E - Bindian Signalizing

We are given a circular arrangement of hills around a capital. Each hill has a height and a watchman who can send signals via fire. The core question is: how many pairs of watchmen can see each other’s signals?