题解
根据公式a*b%2016==(a%2016)*(b%2016)%2016,可以得出如果a%2016的余数乘b%2016的余数是2016的倍数则a和b相乘满足条件。
统计1到n和m范围内对2016取模每个余数出现的次数,枚举1到n内余数为i的数量a[i],枚举1到m内余数为j的数量b[j]。
如果i*j对2016取模等于0,则余数为i的每个数字都可以和余数为j的每个数字进行配对,即数量为a[i]*b[j]求和即可。
AC代码
#include <stdio.h>
#include <bits/stdc++.h>
#define fst first
#define sed second
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 2200;
int a[N], b[N];
int main()
{
#ifdef LOCAL
freopen("C:/input.txt", "r", stdin);
#endif
int n, m;
while (cin >> n >> m)
{
for (int i = 0; i < 2016; ++i) //求nm范围内余数为0~2015的个数
a[i] = n / 2016, b[i] = m / 2016;
for (int i = 1; i <= n % 2016; ++i)
++a[i];
for (int i = 1; i <= m % 2016; ++i)
++b[i];
ll ans = 0;
for (int i = 0; i < 2016; ++i) //a*b%2016==(a%2016)*(b%2016)%2016
for (int j = 0; j < 2016; ++j)
if (i * j % 2016 == 0) //枚举每个余数成绩%2016为0则可以组合
ans += 1LL * a[i] * b[j];
cout << ans << endl;
}
return 0;
}