What is wrong with this approach :

I am trying to find the count of number of divisors in a-b by using seive , if i found that i is a divisor of j i just update the count of number of divisors of j by 2 because if k if div of n then n/k is also a div of n , and to avoid doing it twice for k and n/k i am using the check operator.

Here is the solution : [1]: http://ideone.com/A8mkR9