Cod sursa(job #1069958)
Utilizator | Data | 30 decembrie 2013 18:51:43 | |
---|---|---|---|
Problema | Divk | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,nr,v[500005];
int main()
{
int i,j;
f>>n>>k>>a>>b;
for (i=1;i<=n;++i) f>>v[i], v[i]+=v[i-1], v[i]%=k;
for (i=0;i<=n-a;++i)
for (j=i+a;j<=i+b && j<=n;++j)
if (v[i]==v[j]) ++nr;
g<<nr<<'\n';
return 0;
}