Mai intai trebuie sa te autentifici.
Cod sursa(job #565534)
Utilizator | Data | 27 martie 2011 21:20:47 | |
---|---|---|---|
Problema | Divk | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream.h>
#define N 500001
long c[N],n,k,a,b,i,j,t;
long long s[N]={0},l=0;
int main()
{ifstream f1("divk.in");
ofstream f2("divk.out");
f1>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f1>>c[i];
for(j=a;j<=b;j++)
{for(t=1;t<=j;t++)
s[j]+=c[t];
if(s[j]%k==0)
l++;}
for(t=1;t<=n;t++)
{for(j=a;j<=b;j++)
if(j+t<=n)
{s[j]+=c[j+t]-c[t];
if(s[j]%k==0)
l++;}}
f2<<l;
f1.close();
f2.close();
return 0;}