Cod sursa(job #1622231)
Utilizator | Carare Claudiu CronosClaus | Data | 1 martie 2016 09:49:43 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
long int n,k,a,b,aux,s=0,nr=0;
f>>n>>k>>a>>b;
long int v[n+2];
for(int i=1;i<=n;i++)
f>>v[i];
aux=b-a-1;
for(int i=1;i<=n-aux;i++)
{
s=0;
for(int j=i;j<a+i-1;j++)
s+=v[j];
for(int y=a+i;y<=a+i+b;y++)
{
s+=v[y];
if(s%k==0)
nr++;
}
}
g<<nr;
return 0;
}