Cod sursa(job #1342144)
Utilizator | Data | 13 februarie 2015 16:11:41 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n,i,k,a,b,v[500000],s,a1,nr,j,b1,l;
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=a;i<=b;i++)
{
for(j=1;j<=n-i+1;j++)
{
s=0;a1=j;
for(l=j;l<=a1+i-1;l++)s=s+v[l];
if(s%k==0)nr++;
}
}
g<<nr;
return 0;
}