Cod sursa(job #1078187)
| Utilizator | Data | 12 ianuarie 2014 02:48:22 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long sums[500010],results[100010];
int main()
{
ifstream fin("divk.in");
ofstream fout("divk.out");
long long i,n,a,b,k,rez=0;
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>sums[i];
sums[i]+=sums[i-1];
sums[i]=sums[i]%k;
}
for(i=a;i<=n;i++)
{
results[sums[i-a]]++;
if(i>b)
results[sums[i-b-1]]--;
rez+=results[sums[i]];
}
fout<<rez;
return 0;
}