Cod sursa(job #667442)
| Utilizator | Data | 23 ianuarie 2012 09:27:04 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int N=500000;
const int K=100000;
int n,a,b,k;
int s[N],f[K];
long temp;
int secv;
int main()
{
ifstream in("divk.in");
ofstream out("divk.out");
in>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
in>>temp;
temp%=k;
s[i]=(s[i-1]+temp)%k;
secv+=f[s[i]];
f[s[i]]++;
if(s[i-b+1]==s[i])
f[s[i]]--;
}
out<<secv;
return 0;
}
