[HackerEarth] You are given an array A = \{ a_0, a_1...a_{N-1} \} and an integer D. Find the total number of un-ordered pairs (i, j) where i \ne j such that a_i * a_j \equiv 0 \pmod D. - 题解

暂无题解

题目信息
题号 P19574
标题 [HackerEarth] You are given an array A = \{ a_0, a_1...a_{N-1} \} and an integer D. Find the total number of un-ordered pairs (i, j) where i \ne j such that a_i * a_j \equiv 0 \pmod D.
难度 普及-
返回题目