Pagini recente » Borderou de evaluare (job #1428131) | Clasament lot2010mixt | Istoria paginii runda/boss_de_boss | Borderou de evaluare (job #2296925) | Cod sursa (job #2517965)
#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++)
{
s=0;
for (j=1;j<=n;j++)
{
if (j<=i) {s=s+v[j];}
else if (s%d==0) {
p++;
s=s-v[j-i]+v[j];
}
else {s=s-v[j-i]+v[j];}
}
if (s%d==0) p++;
}
g<<p;
}