Cod sursa(job #1630467)
Utilizator | Data | 5 martie 2016 09:34:46 | |
---|---|---|---|
Problema | Divk | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,x,v[500002],nr;
int main()
{
int i,j;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>x;
v[i]=v[i-1]+x;
}
for(i=1;i<=n-a+1;i++)
{
for(j=i+a-1;j<=n && j<=i+b-1;j++)
if((v[j]-v[i])%k==0)
nr++;
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}