2
An algorithmic problem I don't know the solution to
source link: https://codeforces.com/blog/entry/111696
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
An algorithmic problem I don't know the solution to
You are given two integers x and y and array a of n integers. x is initially equal to zero. For every element in the a you can either add it to x, or you can subtract it from x. You have to tell whether you can make the number x equal to the number y by any means. An O(n^2) approach would work too. Additionally all the elements of a are <=300, I don't know if it's of any use.
Note that x should be compared to y only after all the elements of a are either added to it or subtracted from it.
Thanks.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK