Cod sursa(job #689574)
| Utilizator | Data | 24 februarie 2012 17:42:27 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | winners25 | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
long long a, b, v[1001],s[100001],f[100001], i, j, k, n, contor, u;
int main()
{
cin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{cin>>v[i];
s[i]=s[i-1]+v[i];
f[s[i]]=s[i]%k;}
for(i=1;i<=n;i++)
for(j=i+a+1;j<=n, j-i<=b;j++)
if((f[s[i]]==0))
contor++;
cout<<contor<<" ";
return 0;
}
