Codeforces 887 Div2 A,B,C,D Editorial

The problems was very good . was not able to solve C and D during contest, not a good contest for me but learnt a lot. In this video I have tried to explain the intution and code of problem A,B,C and D. problem A: try to unsort a[i] and a[i+1] for each i. problem B: try to reach Ax+By=N; where A is kth no of fibonacci series {f[0]=1,f[1]=0}; where B is kth no of fibonacci seires {f[0]=0, f[1]=1}; and find out the no of integer solution of x and y such that x is less then or equal to y; problem C:- what is the position of x after first day? and then in how many days x will be removed; problem D:for every i and j (abs(bi)!=abs(bj)) and try to find out number of positive intergers in imbalanced array, and then fill positive intergers one by one and according to need fill negative integers. Codeforces contest - #887 : https://codeforces.com/contest/1853 codeforces handle:- https://codeforces.com/profile/manitianajay45 linkedin:- https://www.linkedin.com/in/ajay-bhakar-7a14451a2/ #codeforces #cp #codeforces887