Cod sursa(job #1458005)
| Utilizator | Data | 5 iulie 2015 16:06:58 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<bits/stdc++.h>
#define debug cerr<<"OK";
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n,k,A,B,i,j,a[10010];
int S[10010],cnt;
int main ()
{
fin>>n>>k>>A>>B;
for(i=1;i<=n;i++){
fin>>a[i];
S[i]=S[i-1]+a[i];
}
for(i=1;i<=n-(A-1);i++)
for(j=i+(A-1);j<=n;j++)
if( (S[j]-S[i-1]) % k ==0 && (j-i)+1 >=A && (j-i)+1 <=B )
++cnt;
cout<<cnt;
return 0;
}
