Cod sursa(job #1099089)
Utilizator | Data | 5 februarie 2014 15:52:30 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
int k,a,b,n,i,j,c=0,s=0,v[500000];
f>>n>>k>>a>>b;
for(i=0;i<n;i++)
f>>v[i];
for(i=0;i<n-1;i++)
{
s=v[i];
for(j=i+1;j<n;j++)
{
s=s+v[j];
if(j-i+1>=a&&j-i+1<=b)
if(s%k==0)
c++;
}
}
g<<c;
return 0;
}