problemlink text logic I converted A and B in binary form and stored it in array A[] and B[] respectively. > traverse array A[] for every A[i] is set and B[i] is reset mark pos as i do following step
display count. What im doing is increasing the value of A by factor x, and if its possible to decrease B by same factor overall sum is not going to change. Why im getting WA what im missing. Thanks asked 21 Oct '18, 15:36
