Cod sursa(job #1312363)
| Utilizator | Data | 9 ianuarie 2015 13:49:52 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n,k,a,b,x,i,j,t,c[500002];
int main()
{
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>x;
c[i]=c[i-1]+x;
c[i]=c[i]%k;
if(i>=a)
{
if(i>=b)
{
for(j=i-b+1;j<=i-a+1;j++)
if(c[i]-c[j]==0)
t++;
}
else
{
for(j=0;j<=i-a+1;j++)
if(c[i]-c[j]==0)
t++;
}
}
}
fout<<t;
return 0;
}
