UTPC Contest 11-03-23 Div. 2 (Beginner)

8 problems from UTPC Contest 11-03-23 Div. 2 (Beginner) (contest 104763), difficulty -. 3/8 solutions verified against sample I/O.

8 items

UTPC Contest 11-03-23 Div. 2 (Beginner)

Div. 2 | 8 problems | 3/8 verified | Difficulty - | 8m 57s

#	Problem	Time	✓
A	Jellyfish Art	2m 15s	✓
B	Jellyfish Lights	1m 4s	✓
C	An Odd Meal	35s
D	Jelly Swarm	27s
E	Seacave Jellyfish	23s
F	Seaside Shopping	1m 29s
G	Genome Splicing	1m 3s	✓
H	Jellyfish Sequence	1m 41s

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763H - Jellyfish Sequence

We are given a sequence of integers that grows in a very specific way. The first value is fixed as $a1$. Every next value is constructed from the product of all previous values, multiplied by a carefully chosen prime: at step $i$, we look at all primes that do not divide the…

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763G - Genome Splicing

We are given a target string that represents a genome sequence over the alphabet {A, T, C, G}. We also have a collection of available DNA segments, each also a string over the same alphabet.

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763F - Seaside Shopping

We are given up to 10 time slots, and each slot corresponds to a possible day Yolanda may visit a shop. There are at most 100 items in the shop, and each item is available on some of those 10 days.

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763A - Jellyfish Art

The input is a single integer N, which determines the size of a text drawing of a jellyfish. The drawing has two distinct parts. The body occupies the first N rows. Every body row contains exactly 2N - 1 consecutive 'J' characters.

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763E - Seacave Jellyfish

Codeforces 104763E: Seacave Jellyfish

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763B - Jellyfish Lights

We are given a short sequence of lights in a tunnel, each light being either off (0) or on (1). The goal is to transform this sequence into a perfectly alternating pattern, where adjacent lights always differ.

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763D - Jelly Swarm

Working

Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 2 (Beginner) ›

CF 104763C - An Odd Meal

Working