Unofficial Editorials November Long Challenge (Part 2)

[taran_1407]

base[i] = x; //Since all factors are divided from x, now base is storing reduced array, reduced value of x.

prod[i] = (prod[i-1]*base[i])%P; //prefix modulo product

modInv[i] = modInverse(prod[i], P); //inverse of prefix modulo product

}