Hints From Problem: Codeforces 1834B: Maximum Strength (View all problems)
- In order to maximize the sum, we want the numbers to match up such that we have the most number of positions where one number contains a "9" and the other contains a "0" (for ex. 9990 and 0009) by fluffy_mango
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0