Cod sursa(job #1497683)
Utilizator | Data | 7 octombrie 2015 09:33:44 | |
---|---|---|---|
Problema | Divk | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int a,b,n,k,x[500001],i,j,l;
long long nr,s;
int main()
{
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>x[i];
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
if(j-i+1>=a && j-i+1<=b)
{
s=0;
for(l=i;l<=j;l++)
s+=x[l];
if(s%k==0)
nr++;
}
}
fout<<nr;
return 0;
}