Cod sursa(job #1735248)
Utilizator | Data | 29 iulie 2016 13:02:34 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
unsigned long long x[500005],s[500005];
int main()
{
int n,k,a,b;
fin>>n>>k>>a>>b;
int i;
for(i=1;i<=n;i++)
fin>>x[i];
for(i=1;i<=n;i++)
s[i]=s[i-1]+x[i];
int j,nr=0;
for(i=1;i<=n;i++)
for(j=0;j<i;j++)
if(i-j<=b&&i-j>=a&&(s[i]-s[j])%k==0)
nr++;
fout<<nr;
}