E. Beautiful Array | Codeforces Round 954 (Div. 3) Solution | Ajit Kushwaha |

So hi in this video i have discussed the problem of Codeforces Round 954 (Div. 3) it is a problem from the contest
E. Beautiful Array Solution
do watch it out :)
#codeforces
#coding
#codeforcessolutions
#codeforcessolution
#codeforces
#codeforcescontest
#codforcesdiv3
#codeforcescontest
#codeforcesround954

[@mithileshmahto1088]

Good explanation Sir👍

[@ajitkushwaha3101]

Acha sir 😏...

[@roshangeorge97]

isnt it similar to if to make a, b equal then we need to take the diff: (a-b) and use this to do like a/(a-b) = b/(a-b) like this we can form a palindrome?

[@ajitkushwaha3101]

I can't understand like what exactly you are trying say but see to make a = b . We can only do this when If(a%k == b%k) then (a-b) will always be divisible with k . And if difference is divisible by k so we just need to add this difference to min(a,b) Now difference/k will be no. Of operations to make them equal that's it.

[@ajitkushwaha3101]

Also one more thing to make a = b I can only do a += k*times. Considering (a