You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Chef is given an array A consisting of N positive integers. Chef shuffles the array A and creates a new array B of length N, where Bi=(Ai+i)mod2, for each i(1≤i≤N).
Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.
Enter link to the question(if question belongs to any online platform) -
Enter your question -
Chef is given an array A consisting of N positive integers. Chef shuffles the array A and creates a new array B of length N, where Bi=(Ai+i)mod2, for each i(1≤i≤N).
Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.
Enter link to the question(if question belongs to any online platform) -
https://www.codechef.com/SEPT21B/problems/SHUFFLIN/
Tags for the question(eg - Array, Basic, Stack, etc.) -
Math, Observation
The text was updated successfully, but these errors were encountered: