Hi,I'have recently solved the Problem Petr and Combination Lock.But I'm not able to understand how we reached the logic of the problem .I was clear at the point where the sum is divisible by 360.But how will we use bitmasks to solve the problem ? Thanks in Advance!