Cod sursa(job #727651)
| Utilizator | Data | 28 martie 2012 10:23:08 | |
|---|---|---|---|
| Problema | Divk | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
long r[500000],s,n,k,a,b,x,nr,i,j;
int main()
{
fstream f("divk.in",ios::in);
fstream g("divk.out",ios::out);
f>>n>>k>>a>>b;
s=0;
for (i=1;i<=n;i++)
{
f>>x;
s=s+x;
r[i]=s%k;
}
r[0]=0;
nr=0;
for (i=0;i<=n-a;i++)
for (j=i+a;(j<=i+b)&&(j<=n);j++) if (r[i]==r[j]) nr++;
g<<nr;
f.close();
g.close();
return 0;
}