Cod sursa(job #724456)
| Utilizator | Data | 26 martie 2012 16:08:47 | |
|---|---|---|---|
| Problema | Divk | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int i,j,h,n,k,a,b,t=0;
long v[500000];
long long s,si;
int main()
{
ifstream inf("divk.in");
inf >> n >> k >> a >> b;
for (i=0; i<n; i++)
inf >> v[i];
inf.close();
si=0;
for (h=0; h<b; h++)
si+=v[h];
for (j=b; j>=a; j--)
{
s=si;
if (s%k==0)
t++;
for (h=j; h<n; h++)
{
s+=v[h]-v[h-j];
if (s%k==0)
t++;
}
si=si-v[j-1];
}
ofstream outf("divk.out");
outf << t << '\n';
outf.close();
return 0;
}