高精度预取模+哈希：CCPC2023深圳M

本文搬运自本人高中时期CSDN博客，若图片加载不出来，可到原文查看：https://blog.csdn.net/zhangtingxiqwq/article/details/134371578

https://vjudge.net/problem/CSG-1249

对于取模操作，我们可以预处理，则三数之和只能是 0,M,2M0,M,2M

然后哈希一下即可

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
 #define debug(...) fprintf(stdout, ##__VA_ARGS__)
#else
 #define debug(...) void(0)
#endif
#define int long long
inline int read(){int x=0,f=1;char ch=getchar(); while(ch<'0'||
ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
#define Z(x) (x)*(x)
#define pb push_back
#define fi first
#define se second
//srand(time(0));
#define N 510
#define M2 20010
#define mo (int)(1e14+9)
int n, m, i, j, k, T;
int M, K, a[N], b[M2], nxt; 
char s[M2]; 
int ans; 
map<int, int>mp; 

int Mod(int a) {
	return (a%mo+mo)%mo; 
}

int check() {
	int flg=0, j, k; 
	for(int i=1; i<=K; ++i) {
		if(b[i]>=10) flg=1; 
		j=i%K+1; k=b[i]/10; b[i]%=10; b[j]+=k; 
	}
	return flg; 
}

void no9() {
	int flg=0, i; 
	for(i=1; i<=K; ++i) if(b[i]!=9) break; 
	if(i>K) {
		for(i=1; i<=K; ++i) b[i]=0; 
	}
}

signed main()
{
	#ifdef LOCAL
	  freopen("in.txt", "r", stdin);
	  freopen("out.txt", "w", stdout);
	#endif
//	T=read();
//	while(T--) {
//
//	}
	n=read(); K=read(); 
	for(j=1, M=0; j<=K; ++j) M=(M*10+9)%mo; 
	debug("M : %lld\n", M); 
	for(i=1; i<=n; ++i) {
		memset(b, 0, sizeof(b)); 
		scanf("%s", s+1); m=strlen(s+1); 
		reverse(s+1, s+m+1); 
		for(j=1; j<=m; ++j) {
			k=(j-1)%K+1; b[k]+=s[j]-'0';
		}
		while(check()); no9(); 
		for(j=K; j>=1; --j) debug("%lld|", b[j]); 
		for(j=K; j>=1; --j)	a[i]=(a[i]*10+b[j])%mo; 
		debug(" %lld : %lld\n", i, a[i]); 
	}
	for(j=1; j<=n; ++j) {
		mp.clear(); 
		for(i=1; i<=j; ++i) mp[Mod(a[i]+a[j])]++; 
		for(i=j; i<=n; ++i) {
			ans+=mp[Mod(M-a[i])];
			ans+=mp[Mod(2*M-a[i])]; 
			ans+=mp[Mod(0-a[i])]; 
		}
	}
	printf("%lld", ans); 
	return 0;
}