CE 求调

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <unordered_map>
#define int __int128
using namespace std;
int T = 1,n,m,k,a[200005],b[200005],c[200005],gen[2000005];
string s,t[100005];
unordered_map<int,int>mp[20];
long long N;
void slove()
{
	int ans = 0;
	cin >> N,n = N;
	cin >> N,m = N;
	for(int i = 1;i <= n;i ++)
	{
		cin >> N,a[i] = N;gen[i] = 1;
		int dd = a[i],len = 0;
		while(dd > 0)
			len ++,dd /= 10,gen[i] *= 10;
		mp[len][a[i] % m] ++;
	}
	for(int i = 1;i <= n;i ++)
	{
		int cnt = 1;
		for(int j = 1;j <= 10;j ++)
		{
			cnt *= 10;
			int qe = a[i] * cnt % m;
			if(qe == 0)ans += mp[j][0];
			else ans += mp[j][m - qe];
		}
		if((gen[i] * a[i] % m + a[i] % m) % m == 0)ans --;
	} 
	cout << (long long)ans;
}
signed main()
{
	//cin >> T;
	while(T --)slove();
}