Codeforces Contest 1056 problem B Divide Candies —— 取模的一个性质

Arkady and his friends love playing checkers on an n×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 (i2+j2) candies of unique type.

There are m friends who deserve the present. How many of these n×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≤n≤109, 1≤m≤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.

Examples
inputCopy
3 3
outputCopy
1
inputCopy
6 5
outputCopy
13
inputCopy
1000000000 1
outputCopy
1000000000000000000
Note
In the first example, only the set for cell (3,3) can be split equally (32+32=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 12+22=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.

题意：

给你n,m，有一个n*n的方块，第i,j个方块里有i*i+j*j个糖，问你有多少的方块能够正好被m整除。

题解：

只要知道了$(i\ast i+j\ast j)\%m=(i\%m\ast i\%m+j\%m\ast j\%m)\%m$就好了，我们只需要m*m的时间就可以做出来。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    ll ans=0;
    for(int i=1;i<=min(n,m);i++)
    {
        for(int j=1;j<=min(n,m);j++)
        {
            if((i*i+j*j)%m==0)
                ans+=(ll)(n/m+(n%m>=i))*(n/m+(n%m>=j));
        }
    }
    printf("%lld\n",ans);
    return 0;
}