D. Concatenated Multiples

题意：给出数组，任意拼接后mod k==0；如123，234；拼接后123234；问有多少种组合；

思路：（数学不好=-=）(x*10^len+y)%k==0   =>  x*10^len==(k-y)%k;预处理出x*10^len，每个长度位len的集合

,然后二分找出(k-y)%k；还有除去自己与自己的拼接；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int n;
ll k;
ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%k;
        x=x*x%k;
        n>>=1;
    }
    return ans;
}

vector<ll>v[15];
ll a[maxn];
int len[maxn];
int main()
{
    //freopen("input.txt", "r", stdin);
    //FASTIO;
    cin>>n>>k;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        int x=a[i];
        for(int j=1;j<=10;j++)
        {
            ll tmp=x%k*power((ll)10,j)%k;
            v[j].push_back(tmp%k);
        }
        int l=0;
        while(x)
        {
            l++;
            x/=10;
        }
        len[i]=l;
    }
    ll ans=0;
    for(int i=1;i<=10;i++)
    {
        sort(v[i].begin(),v[i].end());
    }
    for(int i=0;i<n;i++)
    {
        int ri=upper_bound(v[len[i]].begin(),v[len[i]].end(),(k-a[i]%k)%k)-v[len[i]].begin();
        int le=lower_bound(v[len[i]].begin(),v[len[i]].end(),(k-a[i]%k)%k)-v[len[i]].begin();
        ans+=(ll)(ri-le);
        if(((a[i]%k)*power(10,len[i])%k+a[i]%k)%k==0) ans--;//减去自身拼合
        //cout<<ans<<endl;
    }
    cout<<ans<<endl;
    return 0;
}