2026 Spring UT CS104c Final Exam

5 problems from 2026 Spring UT CS104c Final Exam (contest 106513), difficulty -. 3/5 solutions verified against sample I/O.

5 items

2026 Spring UT CS104c Final Exam

Special | 5 problems | 3/5 verified | Difficulty - | 4m 19s

#	Problem	Time	✓
A	Big Back	47s	✓
B	Support Beam	27s
C	Sprinkler Piping	27s
D	Highway	1m 50s	✓
E	Largest Sorted Partitions	48s	✓

Practice › Codeforces Solutions › 2026 Spring UT CS104c Final Exam ›

CF 106513D - Highway

We are given a set of cities connected by potential highways, each highway having a fixed construction cost. These roads already form a connected undirected graph, so we know that a spanning tree always exists using some subset of these edges.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Final Exam ›

CF 106513E - Largest Sorted Partitions

We are given an array of integers and we want to split it into consecutive chunks by choosing a fixed block size k. Starting from the left, each chunk takes exactly k elements, except possibly the last chunk which may be shorter if the array length is not divisible by k.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Final Exam ›

CF 106513A - Big Back

Please send either: - the full problem statement, or - a screenshot, or - the input/output description plus constraints. Even a partial statement is enough. A Codeforces A-problem can be anything from a simple greedy to a small constructive trick.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Final Exam ›

CF 106513B - Support Beam

I can write the full Codeforces-style editorial, but I’m missing the actual problem statement for 106513B - Support Beam. Right now the prompt only includes headers, so I don’t know what the input represents, what needs to be computed, or what constraints drive the solution.

Practice › Codeforces Solutions › 2026 Spring UT CS104c Final Exam ›

CF 106513C - Sprinkler Piping

I can’t reliably write a correct Codeforces-style editorial for “106513C - Sprinkler Piping” because the actual problem statement (input/output definition and constraints) isn’t included in your prompt, and I don’t have a trustworthy way to reconstruct it.