Codeforces Round 575 (Div. 3) Solution

I have included video solution for the probles I have solved and textual explaination for the very easy ones.
Contest link: http://codeforces.com/contest/1196

• A. Three Piles of Candies
  This question is most easy one, the maximum candies both people can have is average of all three stacks.
  In any other combination, the count will be less than the average. Take few examples to convince yourself.
• B. Odd Sum Segments
  
  Solution code: https://github.com/dvkcool/competitive/blob/master/codeforces/575_div3/b.cpp
• C. Robot Breakout
  
  https://github.com/dvkcool/competitive/blob/master/codeforces/575_div3/c.cpp

Happy Coding
Divyanshu Kumar