olymmath

CMO 2016 Problem 1

  • Day 1

Let a1,a2,⋯ ,a31;b1,b2,⋯ ,b31a_1,a_2,\cdots, a_{31} ;b_1,b_2, \cdots, b_{31} be positive integers such that a1<a2<⋯<a31≤2015a_1< a_2<\cdots< a_{31}\leq2015 , b1<b2<⋯<b31≤2015b_1< b_2<\cdots<b_{31}\leq2015 and a1+a2+⋯+a31=b1+b2+⋯+b31.a_1+a_2+\cdots+a_{31}=b_1+b_2+\cdots+b_{31}. Find the maximum value of S=∣a1−b1∣+∣a2−b2∣+⋯+∣a31−b31∣.S=|a_1-b_1|+|a_2-b_2|+\cdots+|a_{31}-b_{31}|.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator cn-mo/2016/p1 · Tag 977NT8DE5N · Edit this page on GitHub · Keys: j next, k previous