Cod sursa(job #46585)
Utilizator | Tzogorean Alex the_dragon_of_rock | Data | 2 aprilie 2007 19:18:24 |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 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;
s[0]=0;
for (i=1;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
}
in.close();
if (b<a)
{
x=a;
a=b;
b=x;
}
int j;
ofstream out("divk.out");
for (i=0;i<n;i++)
for (j=i+1;j<=n;j++)
if ((s[j]-s[i])%k==0 && j-i>=a && j-i<=b)
t++;
out<<t;
out.close();
return 0;
}