Recently the codeforces is taking like hours to pass on the verdict of submission. It's been more than half an hour and my submission is still in queue .

Can someone tell me why this is happening and for how long this problem is going to persist.

I am trying to learn hashing and for this i am solving a problem in which there are n array's of 0 and 1 and given two arrays we have two tell whether they are equal or not.

I have heard that this problem can be solved using hashing but i am unable to come up with a hash function which can give a unique hash value for a given permutation of 0 and 1 in form of array.

Can someone suggest me such a hash function and also how to prove that it is valid.

Problem link http://mirror.codeforces.com/problemset/problem/359/D

Here is my solution for the problem http://mirror.codeforces.com/contest/359/submission/27581236 I first created lefty[i] and righty[i] which contains the left and right index of the farthest number such that all numbers between farthest number and number at index i are divisible by a[i] . I created it using sparse table . My solution is failing at testcase 25 can someone please help me to debug it.