However, if you want a break or have other extra time when you can't do problems, reading through random algorithm articles in the locations listed above is a good way to expose you to some new ideas. But it is
In a move, you can travel from a node to one of its neighbors (another node it has a direct edge with). You start with a variablexxwhich is initially equal to00. When you pass through edgeii,xxchanges its value toxXORwixXORwi(wherewiwiis the weight of theii-th edge). ...
I don't think this problem requires a very clever mind, but it contains a lot of evil details that might hinder you from solving it. You might ask me any questions about this problem. Submission is given in the bottom. Evil detail 1: You should pay attention to the memory limit. Many...
The second seems to be a mix of greedy thinking (use big numbers to escape the sum range when you get to it) and a well known greedy problem (with numbers [1,x] you can always find a subset of sum for every value in [0, 1+2+3+...+x]). I've seen easier problems in div1...
One of straightforward ways to start solving problems is going through archive in increasing order of difficulty, but you need to skip to the second page to do that. → Reply MikeMirzayanov 5 years ago, hide # ^ | ← Rev. 2 +117 What do you think about such quick-fix: put non...