Submission #71162972

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
inline int read()
{
    int x=0,t=1;
    char c=getchar();
    while(c<'0' || c>'9')
    {
        if(c=='-')
            t=-1;
        c=getchar();
    }
    while(c>='0' && c<='9')
    {
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*t;
}
inline void write(ll x)
{
    if(x<0)
    {
        x=-x;
        putchar('-');
    }
    if(x>=10) write(x/10);
    putchar(x%10^48);
    return ;
}
inline void write_L(ll x)
{
    write(x);
    putchar('\n');
}
const int N=2e5+10;
const int M=20;
int len[N];
ll pow10[M];
int get_len(int x)
{
    int ans=0;
    while(x)
    {
        ans++;
        x/=10;
    }
    return ans;
}
int main ()
{
    int n=read(),m=read();
    vector<int> vec[M];
    for(int i=1;i<=n;i++)
    {
        int x=read();
        int t=get_len(x);
        len[i]=t;
        vec[t].push_back(x);
    }
    pow10[0]=1;
    for(int i=1;i<=10;i++)
        pow10[i]=pow10[i-1]*10ll%m;
    ll ans=0;
    for(int l=1;l<=10;l++)
    {
        ll mul=pow10[l]%m;
        for(int k=1;k<=10;k++)
        {
            unordered_map<long long,int> cnt;
            for(int i:vec[k])
            {
                ll r=i*1ll*mul%m;
                cnt[r]++;
            }
            for(int i:vec[l])
            {
                ll t=(-i%m+m)%m;
                if(cnt.count(t))
                    ans+=cnt[t];
            }
        }
    }
    write_L(ans);
    return 0;
}

Submission Info

Compile Error

./Main.cpp:44:4: warning: built-in function 'pow10' declared as non-function [-Wbuiltin-declaration-mismatch]
   44 | ll pow10[M];
      |    ^~~~~

Judge Result