Cod sursa(job #2254472)
Utilizator | Data | 5 octombrie 2018 14:20:37 | |
---|---|---|---|
Problema | Divk | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,sol;
int dp[500001];
int main()
{
f>>n>>k>>a>>b;
for(int i=1;i<=n;++i)
{
int x;
f>>x;
dp[i]=x+dp[i-1];
}
for(int i=1;i<=n;++i)
{
for(int j=a;j<=b && i-j>=0;++j)
{
int s=dp[i]-dp[i-j];
if(s%k==0)
{
sol++;
}
}
}
g<<sol;
}