Cod sursa(job #1631474)
Utilizator | Data | 5 martie 2016 16:28:00 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,v[500001],i,j,sum,ok,l;
int main()
{
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)f>>v[i];
for(i=1;i<=n;i++)
{
sum=0;
l=0;
for(j=i;j<=i+b;j++)
{
if(j>n)break;
sum=sum+v[j];
l++;
if(sum%k==0 && l<=b && l>=a)ok++;
}
}
g<<ok;
return 0;
}