Cod sursa(job #2219546)
| Utilizator | Data | 9 iulie 2018 11:58:27 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream f("divik.in");
ofstream g("divik.out");
int n,a,b,k,sir[500002],contor=0;
sir[0]=0;
f>>n>>k>>a>>b;
for(int i=1;i<=n;i++) {
f>>sir[i];
sir[i]=(sir[i-1]+sir[i]%k)%k;
}
int j=a;
while(j<=b) {
for(int i=j;i<=n;i++) {
if((sir[i]-sir[i-j])==0) {
contor++;
}
}
j++;
}
g<<contor;
f.close();
g.close();
}
