← CSES Better

Angry Cows

USACO · 2016 · January · gold-1

Open official problem ↗
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

dynamic-programming · greedy · binary-search

The organizer’s problem statement is available at the official source link.

sample trace

Angry Cows: dynamic programming walkthrough

Angry Cows: use the linked editorial?s dynamic programming, greedy idea on the published sample, then verify the displayed output.

Published input5 8 10 3 11 1modelAlgorithm ideaTrack smaller states that summarize partial solutions. For each state, combine the legal predecessor states; the full-task state gives the result.task resultExpected output3.0
  1. 1

    State

    Choose a compact value for each partial subproblem so later choices need only that summary.
  2. 2

    Transition

    Combine legal smaller states to compute reachability, a count, or an optimum for the next state.
  3. 3

    Finish

    Read the state representing the full task and compare it with the published sample output.
  4. 4

    Verify the sample

    Use the published sample output to check the result of this idea on the displayed input.
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|12 lines, 156 chars

Run output

Run your code to see output.