SUFE ICPC Team Formation Test

7 problems from SUFE ICPC Team Formation Test (contest 102388), difficulty -. 5/7 solutions verified against sample I/O.

7 items

SUFE ICPC Team Formation Test

ICPC/IOI | 7 problems | 5/7 verified | Difficulty - | 53m 15s

#	Problem	Time	✓
A	Strange Base	10m 17s	✓
B	Stars	1m 47s
C	Snooker	9m 35s	✓
D	Secret Messages	9m 58s	✓
E	Stables	6m
F	Shopping	8m 32s	✓
G	Snails	7m 6s	✓

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388B - Stars

A star exists at every point whose two coordinates are integers. For each test case, we are given the two endpoints of a straight line segment, and we need to count every integer-coordinate point that lies on that segment, including both endpoints.

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388E - Stables

We have an undirected graph with at most 50 cities. A road lets a horse move between its two endpoints in one step, and a road may also be a self-loop. For a fixed city v, we need to decide whether there exists a walk that starts at v, uses exactly k roads, and ends back at v.

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388F - Shopping

We have n coin denominations, and each denomination can be used any number of times. For a target amount m, we need to count how many different multisets of coins sum exactly to m. The order of the coins does not matter, so 2 + 3 and 3 + 2 represent the same way of making change.

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388A - Strange Base

We need to print the unique canonical representation of a positive integer (n) using powers of the golden ratio [ phi=frac{1+sqrt5}{2}. ] Each position contains either (0) or (1), and two neighboring positions can never both contain (1).

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388G - Snails

We track a snail that starts at depth n, where depth 0 means it has reached the ground. During each day it climbs a meters. If that climb reaches or passes the ground, the snail escapes immediately and the process ends.

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388D - Secret Messages

For each testcase, we receive one nonempty string containing only English letters. The required encoding applies three transformations in the order described by the problem: change every letter to the opposite case, reverse the entire string, and apply ROT13 while preserving…

Practice › Codeforces Solutions › SUFE ICPC Team Formation Test ›

CF 102388C - Snooker

We have a rectangular table of width m and height n. The ball starts at the interior point (x0, y0) and must reach (x1, y1). It always travels along straight segments, reflecting from a wall with equal incident and reflection angles.