This problem Cheems VS Doge CHVSDO is from a recent contest.
I want to know where my code has failed. I picked up a successful submission and stressed it with mine on around 1200 randomly generated testcases satisfying the constraints, but no success at all : ( Maybe it’s some trivial edge case.
Can I get the input/output for the same or the test case on which my code fails?
I’ve used a segmented sieve like approach to find the count of all prime divisors and after that the classic subset sum to find the answer modulo.