Mail.Ru Cup 2018 Round 3 B. Divide Candies

Divide Candies

time limit per test: 1 second memory limit per test: 256 megabytes input: standard input output: standard output

Arkady and his friends love playing checkers on an $n\times n$ field. The rows and the columns of the field are enumerated from $1$ to $n$.

The friends have recently won a championship, so Arkady wants to please them with some candies. Remembering an old parable (but not its moral), Arkady wants to give to his friends one set of candies per each cell of the field: the set of candies for cell $(i,j)$ will have exactly $(i^2+j^2)$ candies of unique type.

There are $m$ friends who deserve the present. How many of these $n\times n$ sets of candies can be split equally into $m$ parts without cutting a candy into pieces? Note that each set has to be split independently since the types of candies in different sets are different.

Input

The only line contains two integers $n$ and $m$ ($1\le n\le 10^9$, $1\le m\le 1000$) — the size of the field and the number of parts to split the sets into.

Output

Print a single integer — the number of sets that can be split equally.

Example

$\mathtt{input}$
3 3
$\mathtt{output}$
1

$\mathtt{input}$
6 5
$\mathtt{output}$
13

$\mathtt{input}$
1000000000 1
$\mathtt{output}$
1000000000000000000

Note

In the first example, only the set for cell $(3,3)$ can be split equally ($3^2+3^2=18$, which is divisible by $m=3$).

In the second example, the sets for the following cells can be divided equally:

• $(1,2)$ and $(2,1)$, since $1^2+2^2=5$, which is divisible by $5$;
• $(1,3)$ and $(3,1)$;
• $(2,4)$ and $(4,2)$;
• $(2,6)$ and $(6,2)$;
• $(3,4)$ and $(4,3)$;
• $(3,6)$ and $(6,3)$;
• $(5,5)$.

In the third example, sets in all cells can be divided equally, since $m=1$.

Tutorial

根据题意可以将题目转换为，在 $1$ 到 $n$ 的范围内，有多少个点满足 $(i^2+j^2)\mathrm{mod}m=0$，由于 $n$ 的范围为 $1\le n\le 10^9$，哪怕是 $\mathcal{O}(n)$ 的时间复杂度也会超时，所以我们需要借助公式 $ (i ^ 2 + j ^ 2) \mod m = ((i \mod m) ^ 2 + (j \mod m) ^ 2) \mod m$，由于对 $m$ 取模后一定比 $m$ 小，这样就将需要遍历的范围缩小成了 $m$ 的范围，而 $m$ 的范围是 $1\le m\le 1000$，所以可以用 $\mathcal{O}(m^2)$​ 的时间复杂度解决问题

对于任意两个数，如果他们取模后的值为 $x$ 和 $y(x,y\in [1,m])$ 且 $(x^2+y^2)\mathrm{mod}m=0$，则这两个数是满足题意的，而对于任意数 $x$，$x,x+m,x+2m,\dots ,x+km(1\le k\le \frac{n-x}{m})$ 均符合题意，所以对于一个数 $x$ 共有 $\frac{n-x}{m}+1$ 个数取模等于 $x$，最后根据满足题意的两个数进行排列组合相乘即可

此解法时间复杂度为 $\mathcal{O}(m^2)$

Solution

import sys
input = lambda: sys.stdin.readline().strip()

n, m = map(int, input().split())
ans = 0
for i in range(1, m + 1):
    cnt_i = (n + m - i) // m
    for j in range(1, m + 1):
        cnt_j = (n + m - j) // m
        if (pow(i, 2, m) + pow(j, 2, m)) % m == 0:
            ans += cnt_i * cnt_j
print(ans)