|
|
back to boardHints ans is amount of prime divisors of b/a+1 (if b mod a=0) you can try only numbers from 2 to 10^5 and count. if then this n>1 then res++ (because there is a prime > 10^5 and that is only number that we haven't checked). Sorry for my poor English. :) |
|
|