提交时间:2026-10-29 15:44:48

运行 ID: 43429

#include<bits/stdc++.h> using namespace std; #define int long long const int N = 1e6+10; int n,p; int a[N]; int ans; signed main(){ // freopen("a.in","r",stdin); // freopen("a.out","w",stdout); cin >> n >> p; for (int i=1;i<=n;i++){ cin >> a[i]; a[i]+=a[i-1]; } for (int i=1;i<=n;i++) a[i]%=p; a[0]=0; int ls=n; // last for (int i=ls;i>1;i=ls){ for (int j=i-1;j>=0;j--){ // cout << j << endl; if (a[i]==a[j]){ ans++; ls=j; break; } } } if (a[1]==0) ans++; cout << ans; return 0; }