Viewing insights from Codeforces 1857F: Sum and Product that are similar (thus shared) with only this insight from Codeforces 1863B: Split Sort: Observe the number of pairs s.t. ai>aj and i<j return; I thought it had smth do be done with quicksort by darth_raider
- With restrictions on sum and product, we can calculate the values of the pair using Viete's formula. Count the number of pairs that satisfy using simple combinatorics. by Koyote
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