Cod sursa(job #3316189)
| Utilizator | Data | 17 octombrie 2025 19:21:15 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
unsigned long long n,i,j,k,a,b,v[10000],s[10000],nr;
int main()
{
cin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
cin>>v[i];
s[i]=s[i-1]+v[i]%k;
}
for(i=1;i<=n-a;i++)
{
for(j=i+a-1;j<=i+b,j<=n;j++)
{
if((s[j]-s[i-1])%k==0)
{
nr++;
//cout<<i<<" "<<j<<endl;
}
}
}
cout<<nr;
return 0;
}
