Cod sursa(job #1221918)
| Utilizator | Data | 21 august 2014 18:05:20 | |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int a[500100];
int fr[100100];
int main()
{
int n, k, A, i, B, x, s=0;
fin>>n>>k>>A>>B;
for(i=1;i<=n;i++)
{
fin>>x;
a[i]=(x+a[i-1])%k;
//cout<<a[i]<<" ";
}
// cout<<"\n";
for(i=1;i<=n;i++)
{
if(i>=A)
{
fr[a[i-A]]++;
}
if(i>=B+1)
{
fr[a[i-B-1]]--;
}
// cout<<fr[a[i]]<<" ";
s+=fr[a[i]];
}
// cout<<"\n";
fout<<s;
}
