2026 Spring UT CS104c Midterm #1

5 problems from 2026 Spring UT CS104c Midterm #1 (contest 106383), difficulty -. 2/5 solutions verified against sample I/O.

5 items

2026 Spring UT CS104c Midterm #1

Special | 5 problems | 2/5 verified | Difficulty - | 2m 40s

#	Problem	Time	✓
A	Factorial Frenzy	31s	✓
B	Store Statistics	25s
C	Group Movie Night	57s	✓
D	Cubic Equation	28s
E	Magikarp: Far From Home	19s

Practice › Codeforces Solutions › 2026 Spring UT CS104c Midterm #1 ›

CF 106383C - Group Movie Night

We are given a set of movies and a group of people, where each person comes with two statements about movies. Each statement is either saying a specific movie should be included in the watch list or saying a specific movie should be excluded.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Midterm #1 ›

CF 106383D - Cubic Equation

The task is to find the real solution of a cubic equation of the special form $$f(x) = x^3 + ax + b$$ where the input gives the two coefficients a and b. Both values are non-negative, which guarantees that the equation has exactly one real root.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Midterm #1 ›

CF 106383E - Magikarp: Far From Home

I can write the editorial, but the problem statement details available for Codeforces 106383E - Magikarp: Far From Home are only enough to identify the core task (single-source shortest paths on a directed weighted graph).

Practice › Codeforces Solutions › 2026 Spring UT CS104c Midterm #1 ›

CF 106383A - Factorial Frenzy

The task asks for the number of zero bits at the end of the binary representation of a factorial. The input is a single integer n, and the output is how many times the binary value of n! can be divided by 2 before it becomes odd. The value of n!

Practice › Codeforces Solutions › 2026 Spring UT CS104c Midterm #1 ›

CF 106383B - Store Statistics

Sure. Please provide the Codeforces problem statement (or link, name, and constraints), and I’ll write a detailed editorial in a competitive-programming style.