Cod sursa(job #729860)
| Utilizator | Data | 30 martie 2012 14:22:52 | |
|---|---|---|---|
| Problema | Divk | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
using namespace std;
long long sume[500010],nr;
long long sol;
int numar;
int a,b,k,n;
ifstream in("divk.in");
ofstream out("divk.out");
int main()
{
in>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
in>>numar;
sume[i]=sume[i-1]+(long long)numar;
}
for(int i=1;i<=n;i++)
for(int j=i;j>=1;j--)
if(i-j+1>=a && i-j+1<=b)
{
if((sume[i]-sume[j])%k==0) sol=sol+1LL;
}
else if(i-j+1>b) break;
out<<sol;
}