UT 104c Midterm #1

4 problems from UT 104c Midterm #1 (contest 106104), difficulty -. 1/4 solutions verified against sample I/O.

4 items

UT 104c Midterm #1

Special | 4 problems | 1/4 verified | Difficulty - | 1m 57s

#	Problem	Time	✓
A	Sum of Squares	36s
B	Winning Record	21s
C	Buying Fruit	39s	✓
D	Interview Flights	21s

Practice › Codeforces Solutions › UT 104c Midterm #1 ›

CF 106104D - Interview Flights

The name “Interview Flights” strongly suggests a scheduling or graph traversal problem involving flights, often modeled as directed edges with time constraints.

Practice › Codeforces Solutions › UT 104c Midterm #1 ›

CF 106104C - Buying Fruit

We start with a full set of size N. Every step independently picks a number from 1 to N uniformly. If the chosen number is still in the set, we remove it; otherwise the set stays unchanged. The process stops when the set becomes empty.

Practice › Codeforces Solutions › UT 104c Midterm #1 ›

CF 106104A - Sum of Squares

I can write the full editorial in that format, but the actual problem statement is missing from the prompt. The title “Codeforces 106104A - Sum of Squares” is not enough to identify the exact task reliably.

Practice › Codeforces Solutions › UT 104c Midterm #1 ›

CF 106104B - Winning Record

I cannot reliably reconstruct the full problem statement of Codeforces 106104B - Winning Record from available sources.