Cod sursa(job #2469513)
| Utilizator | Data | 7 octombrie 2019 17:24:27 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long int v1[100001],v2[500001];
int main(){
long long int n,i,a,b,k,s;
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++){
fin>>v2[i];
v2[i]+=v2[i];
v2[i]%=k;
}
s=0;
for(i=a;i<=b;i++){
v1[v2[i-a]]++;
s+=v1[v2[i]];
}
for(i=b+1;i<=n;i++){
v1[v2[i-a]]++;
v1[v2[i-b-1]]--;
s+=v1[v2[i]];
}
fout<<s;
return 0;
}
