2004-2005 Northwestern European Regional Contest (NWERC 2004)

9 problems from 2004-2005 Northwestern European Regional Contest (NWERC 2004) (contest 106175), difficulty -. 9/9 solutions verified against sample I/O.

9 items

2004-2005 Northwestern European Regional Contest (NWERC 2004)

Special | 9 problems | 9/9 verified | Difficulty - | 7m 49s

#	Problem	Time	✓
A	Word Encoding	56s	✓
B	Watchdog	53s	✓
C	Taxi Cab Scheme	55s	✓
D	Pseudo-random Numbers	50s	✓
E	Card Game Cheater	55s	✓
F	Investment	52s	✓
G	Pipes	51s	✓
H	SETI	52s	✓
I	Minimax Triangulation	45s	✓

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175D - Pseudo-random Numbers

We are given a deterministic generator that starts from a large base-B number and repeatedly transforms it into shorter and shorter numbers. Each step outputs one digit: specifically the last digit of the current number in base B.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175B - Watchdog

We are given a square roof with integer coordinates, from $(0,0)$ to $(S,S)$, and a set of hatch positions inside it. We must choose a single point on the roof where a leash is attached.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175H - SETI

We are given a prime number $p$ and a string that represents the output of a hidden numeric process applied to an unknown sequence of coefficients $a0, a1, dots, a{n-1}$, where each coefficient is an integer in the range $[0, p-1]$.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175G - Pipes

We are given a rectangular floor plan made of small square rooms arranged in an r by c grid. Between adjacent rooms there are walls, and each wall has a digit cost indicating how expensive it is to drill a pipe through that boundary.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175I - Minimax Triangulation

We are given a simple polygon described by its vertices in cyclic order. The polygon is guaranteed not to self-intersect, so its boundary forms a clean closed shape.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175E - Card Game Cheater

We are given two players who each receive the same number of cards from a standard deck. The cards are already fixed for both players, but only Eve is allowed to reorder her cards freely before the game starts.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175F - Investment

We are given an initial amount of money and a fixed number of years. Each year, we are allowed to hold a multiset of bonds. Each bond type has a purchase cost and produces a fixed yearly profit.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175A - Word Encoding

We are given a language over lowercase letters where some short patterns are forbidden as substrings. Any string that contains at least one forbidden pattern is considered invalid and removed from the language.

Practice › Codeforces Solutions › 2004-2005 Northwestern European Regional Contest (NWERC 2004) ›

CF 106175C - Taxi Cab Scheme

We are given a sequence of pre-booked taxi rides in a city where travel happens on a grid. Each ride has a fixed start time and a start and end coordinate.