For a given exhibit a comprising of n integers and a given integer m find in case it is feasible to reorder components of the cluster a so that ∑ni=1∑nj=iajj rises to m? It is prohibited to erase components just as addition new components. If it's not too much trouble, note that no adjusting happens
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
For a given exhibit a comprising of n integers and a given integer m find in case it is feasible to reorder components of the cluster a so that ∑ni=1∑nj=iajj rises to m? It is prohibited to erase components just as addition new components. If it's not too much trouble, note that no adjusting happens during division, for instance, 52=2.5.
Input
The principal line contains a solitary integer t — the number of experiments (1≤t≤100). The experiments follow, each in two lines.
The primary line of an experiment contains two integers n and m (1≤n≤100, 0≤m≤106). The subsequent line contains integers a1,a2,… ,an (0≤
Output
For each experiment print "YES", in case it is feasible to reorder the components of the cluster so that the given equation gives the given worth, and "NO" in any case
Step by step
Solved in 4 steps with 1 images
