Cod sursa(job #543142)
Utilizator | Data | 27 februarie 2011 16:36:30 | |
---|---|---|---|
Problema | Divk | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int i,j,n,m,k,a,b;
unsigned long s=0,p[5000001],nr=0;
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>p[i];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=i+b-1&&j<=n;j++)
{
s+=p[j];
if(s%k==0&&j-i+1>=a)
nr++;
}
}
g<<nr;
return 0;
}