Cod sursa(job #2517953)
Utilizator | Data | 4 ianuarie 2020 16:12:04 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
long long a,b,n,d,i,m,j,p,s;
int v[500005];
int main()
{
ifstream f ("divk.in");
ofstream g ("divk.out");
f>>n>>d>>a>>b;
for (i=1;i<=n;i++)
{f>>v[i];}
for (i=a;i<=b;i++)
{
for (j=1;j<=n;j++)
{
if (j<i) {s=s+v[j];}
else if (s%d==0) {
p++;
s=s-v[j-i+1]+v[j];
}
else {s=s-v[j-i+1]+v[j];}
}
}
g<<p;
}