Cod sursa(job #1571329)
| Utilizator | Data | 17 ianuarie 2016 21:30:31 | |
|---|---|---|---|
| Problema | Divk | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int N,K,A,B,v[1000],contor=0,s[1000];
void citire()
{
fin>>N>>K>>A>>B;
s[0]=0;
for(int i=1;i<=N;i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
}
void rezolvare()
{
for(int i=1;i<=N;i++)
for(int j=0;j<i;j++)
if((s[i]-s[j])%K==0 && (i-j)>=A && (i-j)<=B)
contor++;
fout<<contor;
}
int main()
{
citire();
rezolvare();
return 0;
}
