Cod sursa(job #689557)
| Utilizator | Data | 24 februarie 2012 17:27:40 | |
|---|---|---|---|
| Problema | Divk | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | winners25 | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
long long a, b, v[1001],s[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];
for(j=i-1;j>=0;j--)
//for(i=1;i<=n;i++)
// {s[i]=s[i-1]+v[i];
//if(s[i]%k==0 && i>=a && i<=b)
// contor++; }
// for(i=1;i<=n;i++)
// for(j=i+1;j<=n;j++)
if(((s[i]-s[j])%k==0)&&(i-j>=a)&&(i-j<=b))
contor++;}
cout<<contor;
return 0;
}
