[HackerEarth] For a given prime number p find all the number of pairs (m, n) of positive integers such that 1 ≤ m , n ≤ p(p-1)* and p divides nm - mn. Output the result modulo 1000000007. - 题解

暂无题解