Cod sursa(job #1573527)
| Utilizator | Data | 19 ianuarie 2016 19:28:31 | |
|---|---|---|---|
| Problema | Divk | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int N,K,A,B,sp[500005],sol,i,j;
void read()
{
fin>>N>>K>>A>>B;
for(i=1;i<=N;i++)
{
int x;
fin>>x;
sp[i]=(sp[i-1]+x)%K;
}
}
void solve()
{
for(i=1;i<=N-A+1;i++)
{
for(j=i+A-1;j<=i+B-1 && j<=N;j++)
{
if(sp[j]-sp[i-1]==0){sol++;}
}
}
}
void print()
{
fout<<sol<<"\n";
}
int main()
{
read();
solve();
print();
return 0;
}
