思路: 一维前缀和,然后优化
代码:
# include<iostream>
# include<cstring>
# include<cstdio>
# include<algorithm>
using namespace std;
typedef long long LL;
const int N = 100010;
int n,k;
LL s[N],cnt[N];//cnt[]表示余数是i的有多少个
int main()
{
scanf("%d %d",&n,&k);
for(int i = 1;i <= n;i++)
{
scanf("%lld",&s[i]);
s[i] += s[i - 1];
}
LL res = 0;
cnt[0] = 1;//cnt[0]存的是s[]中等于0的数的个数,由于s[0] = 0,所以最初等于0的有1个数,所以cnt[0] = 1
for(int i = 1;i <= n;i++)
{
//判断有多少的s[l]与s[r]余数相等
res += cnt[s[i] % k];
cnt[s[i] % k]++;
}
printf("%lld\n",res);
return 0;
}