Cod sursa(job #1144338)
Utilizator | Data | 16 martie 2014 22:28:48 | |
---|---|---|---|
Problema | Divk | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int i,j,n,k,a,b,x,S[500005];
long long nrsol;
int main()
{
f>>n>>k>>a>>b;
for (i=1;i<=n;i++)
{
f>>x; S[i]=(S[i-1]+x)%k;
}
for (i=a;i<=n;i++)
{
for (j=a;j<=b && i-j+1>0;j++)
{
if (S[i]-S[i-j]==0) nrsol++;
}
}
g<<nrsol;
return 0;
}