Why is this code getting TLE?

Правка en1, от Qualified, 2020-11-14 06:01:15
Code

This is the code. The factorization algorithm is taken from KACTL, same with the Miller-Rabin and with the modmul and the modpow.

My thought process:

If we take each pair and then prime factorize each of the numbers in the pair and then take the union of those prime factors and then for each union, we count the number of primes and if there are $$$n$$$ of those primes in the pairs then, at least one number from each pair will be divisible by that number.

Please let me know if there is a section where it is not clear. Thanks for reading the blog.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en7 Английский Qualified 2020-11-14 15:49:38 7 Tiny change: 'n the pair and then take t' -> 'n the pair. Then take t'
en6 Английский Qualified 2020-11-14 06:16:25 114
en5 Английский Qualified 2020-11-14 06:15:16 73
en4 Английский Qualified 2020-11-14 06:08:38 6
en3 Английский Qualified 2020-11-14 06:08:12 18
en2 Английский Qualified 2020-11-14 06:07:37 306 Tiny change: 'c{1}{4}})$.\n\nPle' -> 'c{1}{4}})$ or $O(n^(\frac{5}{4}))$.\n\nPle'
en1 Английский Qualified 2020-11-14 06:01:15 3727 Initial revision (published)