Fall 2019 ICPC-style Waterloo Local Contest

5 problems from Fall 2019 ICPC-style Waterloo Local Contest (contest 102367), difficulty -. 5/5 solutions verified against sample I/O.

5 items

Fall 2019 ICPC-style Waterloo Local Contest

ICPC/IOI | 5 problems | 5/5 verified | Difficulty - | 22m 57s

#	Problem	Time	✓
A	Cake Distribution	1m 22s	✓
B	Favourite Number	1m 17s	✓
C	Pawn's Revenge	4m 21s	✓
D	Deliveries	9m 6s	✓
E	XOR Pairing	6m 51s	✓

Practice › Codeforces Solutions › Fall 2019 ICPC-style Waterloo Local Contest ›

CF 102367A - Cake Distribution

We need to cut one cake into a small number of integer-weight pieces. The number of guests is not known in advance: it will be exactly (A), (B), or (C).

Practice › Codeforces Solutions › Fall 2019 ICPC-style Waterloo Local Contest ›

CF 102367B - Favourite Number

A positive integer has an odd number of positive divisors exactly when it is a perfect square. Every non-square has divisors that can be paired as d and n/d, while a square has one unpaired divisor, namely its square root. So the task can be restated as follows.

Practice › Codeforces Solutions › Fall 2019 ICPC-style Waterloo Local Contest ›

CF 102367E - XOR Pairing

We have an even number of indexed stones, and each stone carries an integer between 0 and 1000. We must partition all stones into pairs.

Practice › Codeforces Solutions › Fall 2019 ICPC-style Waterloo Local Contest ›

CF 102367D - Deliveries

The warehouses and roads form a tree, so between any two warehouses there is exactly one route. A truck has battery capacity T, and it may recharge whenever Sam stops.

Practice › Codeforces Solutions › Fall 2019 ICPC-style Waterloo Local Contest ›

CF 102367C - Pawn's Revenge

We have an (N times N) chessboard represented by (N) strings. A is an opponent piece, K is our king, and - is an empty square where a pawn may potentially be placed. Pawns move upward, meaning a pawn at row (r+1), column (c) attacks the two squares ((r,c-1)) and ((r,c+1)).