题目链接:K-number
题意:给你一个0-9组成的字符串,统计有多少个子串能被300整除
题解:弄一个前缀数组,前缀和对3取余,统计的时候,当前位是0,结果就+1,如果前面一位也是0,就看与当前位前缀数组中相同值的有多少,因为同前缀的子串是能被3整除的
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define SZ 666666
char s[SZ]; int n, w[SZ], cn[3];
int main()
{
scanf("%s", s + 1); n = strlen(s + 1);
for (int i = 1; i <= n; ++i)
w[i] = (w[i - 1] + s[i]) % 3;
ll ans = 0;
for (int i = 1; i <= n; ++i)
{
if (s[i] == '0')
{
++ans;
if (s[i - 1] == '0')
ans += cn[w[i]];
}
cn[w[i - 1]]++;
}
printf("%lld\n", ans);
}