Cod sursa(job #2036345)
| Utilizator | Data | 10 octombrie 2017 16:51:03 | |
|---|---|---|---|
| Problema | Divk | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
int x[50000];
int n,a,b,k;
int nr=0;
f>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
f>>x[i];
x[i]=x[i]%k;
}
for(int i=1;i<n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(j-i+1>=a&&j-i<b)
{
long int s=0;
for(int z=i;z<=j;z++)
s=s+x[z];
if(s%k==0)nr++;
}
}
}
g<<nr;
return 0;
}
