Cod sursa(job #893672)
Utilizator | Data | 26 februarie 2013 17:08:51 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
fstream f("divk.in", ios::in), g("divk.out" ,ios::out);
int main()
{
int n,k,a,b,v[500001],count=0;
f>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
int sum=0;
for(int j=i;j<=n && j-i<b;j++)
{
sum+=v[j];
if (sum%k==0 && j-i+1>=a )
count++;
}
}
g<<count<<endl;
return 0;
}