Cod sursa(job #46638)
Utilizator | Tzogorean Alex the_dragon_of_rock | Data | 2 aprilie 2007 20:05:10 |
---|---|---|---|
Problema | Divk | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<fstream>
using namespace std;
long int n,a,b,k,t;
long int s[500005];
int main()
{
ifstream in("divk.in");
in>>n>>k>>a>>b;
int i;
long int x;
for (i=1;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
}
in.close();
int j;
for (i=0;i<=n-a+1;i++)
{
if (i+b<n) x=i+b;
else x=n;
for (j=i+a-1;j<=x;j++)
if ((s[j]-s[i])%k==0 && j-i>=a && j-i<=b)
t++;
}
ofstream out("divk.out");
out<<t;
out.close();
return 0;
}