Problems are good, but they could have written the statements much better way.(B,E) :(

preparing for permutation problems :) DYK? A permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

waiting for your story.

if j==m then "\n" will be printed

 ৎ

Ever happened that you stuck in A or B in Div2 after being red???