Conversation
Greedy reduction over 13 value/symbol pairs (7 base + 6 subtractive) sorted descending. For each pair, emit the symbol `num / value` times and take the remainder. The expanded table means greedy never gets stuck producing invalid forms like IIII. O(1) time and space given the 1..=3999 bound. Tutorial covers the intuition behind the expanded table, why greedy is correct, a dry run of 1994, and edge cases at 1, 4, 3749, 3999.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem
Changes
src/src/lib.rsbook/src/problems/book/src/SUMMARY.mdREADME.mdCI Checks
cargo fmt --checkcargo clippycargo testmdbook build