Cod sursa(job #1342132)
Utilizator | Data | 13 februarie 2015 15:59:35 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n,i,k,a,b,v[500000],s,a1,nr,j,b1;
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=n-a+1;i++)
{ a1=i+a-1;b1=a1+b;
while((a1<b1)&&(a1<=n))
{
s=0;
for(j=i;j<=a1;j++)s=s+v[j];
if(s%k==0)nr++;
a1++;
}
}
g<<nr;
return 0;
}