参考博客
https://blog.csdn.net/weixin_44775484/article/details/107442900?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromBaidu-4.control&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromBaidu-4.control
#include<stdio.h>
#include<math.h>
int weishu(long long int val)
{ int num=0;
while(val!=0)
{ num++;
val=val/10;
}
return num;
}
int main()
{
long long int a[100000];
int n;
long long int k;
scanf("%d %lld",&n,&k);
//printf("%d %lld",n,k);
for (int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int len1,len2;
long long int temp1;
long long int temp2;
long long int result1;
long long int result2;
int ans=0;
for(int i=0;i<n;i++) //暴力破解
{
for(int j=i+1;j<n;j++)
{
temp1=a[i];
temp2=a[j];
len1=weishu(temp1);
len2=weishu(temp2);
result1=temp1*pow(10,len2)+temp2;
result2=temp2*pow(10,len1)+temp1;
if(result1%k==0)
{
ans++;
}
if(result2%k==0)
{
ans++;
}
}
}
printf("ans=%d\n",ans);
return 0;
}