提交时间:2024-09-08 15:01:59
运行 ID: 32312
#include <bits/stdc++.h> #define int long long using namespace std; const int md = 998244353; int n,m,k,a[100005],b[100005],A[100005],B[100005]; signed main () { cin >> n >> m >> k; for (int i = 1;i <= n;i++) { cin >> a[i]; a[i] += a[i - 1]; } for (int i = 1;i <= m;i++) { cin >> b[i]; b[i] += b[i - 1]; } for (int i = 1;i <= n;i++) { for (int j = i;j <= n;j++) { int sum = a[j] - a[i - 1]; if (sum <= k) { A[sum]++; A[sum] %= md; } } } for (int i = 1;i <= m;i++) { for (int j = i;j <= m;j++) { int sum = b[j] - b[i - 1]; if (sum <= k) { B[sum]++; B[sum] %= md; } } } int ans = 0; for (int i = 1;i * i <= k;i++) { if (k % i == 0) { ans += A[i] * B[k / i]; ans %= md; ans += A[k / i] * B[i]; ans %= md; } if (i * i == k) { ans -= A[i] * B[i]; ans = (ans + md) % md; } } cout << ans << endl; return 0; }