Cod sursa(job #587728)
| Utilizator | Data | 5 mai 2011 18:53:48 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main()
{int n,k,a,b,s[1000],v[1000],i,q,j;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
q=0;
for(i=1;i<=n;i++)
f>>v[i];
i=2;
s[1]=v[1];
do
{s[i]=v[i]+s[i-1];
i++;}
while(i!=n+1);
for(i=1;i<=n-1;i++)
{for(j=i+a;j<=i+b;j++)
if((s[j]-s[i]%k==0)&&(j<=n))
q++; }
g<<q<<endl;
f.close();
g.close();
return 0;
}