Cod sursa(job #2313329)
Utilizator | Data | 6 ianuarie 2019 17:31:52 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long n,k,a,b,i,j,x[500001],rez,nr;
long long rest[500001];
int main()
{
f>>n>>k>>a>>b;
for(i=1;i<=n;i++){
f>>nr;
x[i]=(nr+x[i-1])%k;
if(i>=a)
rest[x[i-a]]++;
if(i-b>=1)
rest[x[i-b-1]]--;
rez+=rest[x[i]];
}
g<<rez;
}