Мисис 2023 осень - массивы, строки

8 problems from Мисис 2023 осень - массивы, строки (contest 104636), difficulty -. 5/8 solutions verified against sample I/O.

8 items

Мисис 2023 осень - массивы, строки

Special | 8 problems | 5/8 verified | Difficulty - | 10m 22s

#	Problem	Time	✓
A	Oath of the Night's Watch	1m 11s
B	Vlad and Cafes	1m 48s	✓
C	The Rank	1m 23s
D	Watering System	1m 22s
E	YES or YES?	1m 13s	✓
F	Mammoth's Genome Decoding	1m 22s	✓
G	Pangram	59s	✓
H	Hotelier	1m 4s	✓

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636H - Hotelier

We are simulating a very small hotel with exactly ten rooms indexed from 0 to 9. Each room can either be empty or occupied by exactly one guest. Over time, guests either arrive from one of two entrances or leave from a specific room.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636G - Pangram

We are given a string of Latin letters where both uppercase and lowercase characters may appear. The task is to determine whether the string is a pangram, meaning that every letter from 'a' to 'z' appears at least once somewhere in the string, ignoring case differences.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636F - Mammoth's Genome Decoding

We are given a string of length n that represents a partially decoded genome. Each position is either one of the four nucleotides A, C, G, T, or an unknown character ? that must be replaced.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636E - YES or YES?

We are given multiple independent test cases. Each test case consists of a very short string of exactly three characters. The task is to decide whether this string represents the word “YES” when we ignore letter case.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636D - Watering System

We are given a pipe system with $n$ outlets, each outlet having a size $si$. Arkady pours a fixed amount of water $A$ into the system, but he is allowed to block any subset of outlets before doing so.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636B - Vlad and Cafes

We are given a sequence of cafe visits, where each number represents the index of a cafe Vlad visited at that moment in time. Cafes can repeat, meaning Vlad may visit the same cafe multiple times, and we only care about the order of visits.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636C - The Rank

We are given a list of students, each identified by an integer id from 1 to n. Student 1 is Thomas. Every student has four exam scores, and their overall performance is measured by the sum of these four scores.

Practice › Codeforces Solutions › Мисис 2023 осень - массивы, строки ›

CF 104636A - Oath of the Night's Watch

We are given a list of steward strengths, and we need to decide which stewards Jon Snow will support. A steward is supported only if there exists at least one steward with strictly smaller strength and at least one steward with strictly larger strength.