Pagini recente » Cod sursa (job #2576122) | Cod sursa (job #2627687) | Borderou de evaluare (job #2683118) | Borderou de evaluare (job #1468051) | Cod sursa (job #893781)
Cod sursa(job #893781)
#include <fstream>
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int n,k,a,b,v[500001];
long long count=0;
FILE *f,*g;
f = fopen ("divk.in","r");
g = fopen ("divk.out", "w");
fscanf(f, "%d%d%d%d",&n,&k,&a,&b);
for(int i=1;i<=n;i++)
{
int x;
fscanf(f, "%d",&x);
v[i]=x;
}
for(int i=1;i<=n;i++)
{
int sum=0;
for(int j=i;j<=n && j-i<b;j++)
{
sum+=v[j]%k;
sum%=k;
if (sum==0 && j-i+1>=a )
count++;
}
}
fprintf(g, "Name %u ",count);
fclose(f);
fclose(g);
return 0;
}